./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:36:25,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:36:25,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:36:25,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:36:25,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:36:25,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:36:25,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:36:25,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:36:25,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:36:25,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:36:25,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:36:25,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:36:25,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:36:25,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:36:25,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:36:25,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:36:25,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:36:25,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:36:25,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:36:25,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:36:25,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:36:25,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:36:25,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:36:25,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:36:25,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:36:25,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:36:25,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:36:25,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:36:25,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:36:25,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:36:25,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:36:25,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:36:25,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:36:25,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:36:25,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:36:25,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:36:25,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:36:25,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:36:25,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:36:25,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:36:25,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:36:25,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-23 02:36:25,916 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:36:25,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:36:25,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:36:25,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:36:25,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:36:25,918 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:36:25,918 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:36:25,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:36:25,919 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:36:25,919 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:36:25,919 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:36:25,919 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:36:25,920 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:36:25,920 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:36:25,920 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:36:25,920 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:36:25,921 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:36:25,921 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:36:25,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 02:36:25,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 02:36:25,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:36:25,922 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:36:25,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:36:25,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:36:25,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:36:25,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:36:25,923 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-23 02:36:25,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-23 02:36:25,924 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-23 02:36:25,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:36:25,924 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 02:36:25,924 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:36:25,925 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:36:25,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:36:25,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:36:25,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:36:25,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:36:25,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:36:25,926 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:36:25,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:36:25,927 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:36:25,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:36:25,927 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/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_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 [2021-11-23 02:36:26,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:36:26,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:36:26,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:36:26,211 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:36:26,212 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:36:26,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2021-11-23 02:36:26,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/data/6de5ee7ca/0c5947b4b1f1450b91241237a78da181/FLAG00332d3c3 [2021-11-23 02:36:26,823 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:36:26,824 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2021-11-23 02:36:26,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/data/6de5ee7ca/0c5947b4b1f1450b91241237a78da181/FLAG00332d3c3 [2021-11-23 02:36:27,179 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/data/6de5ee7ca/0c5947b4b1f1450b91241237a78da181 [2021-11-23 02:36:27,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:36:27,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:36:27,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:36:27,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:36:27,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:36:27,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b18e3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27, skipping insertion in model container [2021-11-23 02:36:27,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:36:27,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:36:27,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:36:27,403 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:36:27,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:36:27,433 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:36:27,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27 WrapperNode [2021-11-23 02:36:27,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:36:27,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:36:27,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:36:27,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:36:27,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,469 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2021-11-23 02:36:27,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:36:27,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:36:27,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:36:27,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:36:27,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:36:27,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:36:27,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:36:27,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:36:27,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (1/1) ... [2021-11-23 02:36:27,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:36:27,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:27,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:36:27,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:36:27,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:36:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:36:27,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:36:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:36:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:36:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:36:27,678 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:36:27,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:36:27,841 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:36:27,911 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:36:27,911 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-23 02:36:27,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:27 BoogieIcfgContainer [2021-11-23 02:36:27,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:36:27,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:36:27,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:36:27,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:36:27,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:36:27" (1/3) ... [2021-11-23 02:36:27,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34778143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:27, skipping insertion in model container [2021-11-23 02:36:27,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:27" (2/3) ... [2021-11-23 02:36:27,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34778143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:27, skipping insertion in model container [2021-11-23 02:36:27,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:27" (3/3) ... [2021-11-23 02:36:27,923 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-write.c [2021-11-23 02:36:27,928 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:36:27,929 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-11-23 02:36:27,973 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:36:27,980 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:36:27,981 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-11-23 02:36:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-23 02:36:28,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:28,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-23 02:36:28,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash 3271901, now seen corresponding path program 1 times [2021-11-23 02:36:28,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:28,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457964677] [2021-11-23 02:36:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:28,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:28,178 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:28,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457964677] [2021-11-23 02:36:28,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457964677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:28,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:28,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:36:28,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699567666] [2021-11-23 02:36:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:28,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:36:28,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:36:28,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:36:28,222 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:28,324 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-11-23 02:36:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:36:28,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-11-23 02:36:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:28,335 INFO L225 Difference]: With dead ends: 37 [2021-11-23 02:36:28,335 INFO L226 Difference]: Without dead ends: 35 [2021-11-23 02:36:28,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:36:28,345 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:28,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-23 02:36:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2021-11-23 02:36:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-23 02:36:28,386 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2021-11-23 02:36:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:28,386 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-23 02:36:28,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-23 02:36:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-23 02:36:28,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:28,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-23 02:36:28,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:36:28,388 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash 3197824, now seen corresponding path program 1 times [2021-11-23 02:36:28,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:28,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128806672] [2021-11-23 02:36:28,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:28,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:28,498 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128806672] [2021-11-23 02:36:28,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128806672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:28,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:28,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:36:28,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853776173] [2021-11-23 02:36:28,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:28,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:36:28,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:36:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:36:28,504 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:28,555 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2021-11-23 02:36:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:36:28,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-11-23 02:36:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:28,559 INFO L225 Difference]: With dead ends: 37 [2021-11-23 02:36:28,559 INFO L226 Difference]: Without dead ends: 37 [2021-11-23 02:36:28,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:36:28,566 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:28,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:36:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-23 02:36:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2021-11-23 02:36:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-23 02:36:28,580 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 4 [2021-11-23 02:36:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:28,581 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-23 02:36:28,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-11-23 02:36:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-23 02:36:28,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:28,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-23 02:36:28,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:36:28,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash 3199854, now seen corresponding path program 1 times [2021-11-23 02:36:28,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:28,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717916416] [2021-11-23 02:36:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:28,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:28,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717916416] [2021-11-23 02:36:28,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717916416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:28,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:28,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:36:28,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11125133] [2021-11-23 02:36:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:28,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:36:28,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:36:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:36:28,684 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:28,772 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-11-23 02:36:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:36:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-11-23 02:36:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:28,773 INFO L225 Difference]: With dead ends: 42 [2021-11-23 02:36:28,773 INFO L226 Difference]: Without dead ends: 42 [2021-11-23 02:36:28,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:36:28,775 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:28,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-11-23 02:36:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2021-11-23 02:36:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-23 02:36:28,780 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 4 [2021-11-23 02:36:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:28,780 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-23 02:36:28,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-23 02:36:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:36:28,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:28,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:36:28,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:36:28,782 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 99132597, now seen corresponding path program 1 times [2021-11-23 02:36:28,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486684099] [2021-11-23 02:36:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:28,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:28,830 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:28,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486684099] [2021-11-23 02:36:28,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486684099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:28,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:28,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:36:28,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244545623] [2021-11-23 02:36:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:28,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:36:28,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:36:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:36:28,836 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:28,885 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-11-23 02:36:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:36:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-11-23 02:36:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:28,888 INFO L225 Difference]: With dead ends: 22 [2021-11-23 02:36:28,888 INFO L226 Difference]: Without dead ends: 22 [2021-11-23 02:36:28,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:36:28,900 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:28,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:36:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-23 02:36:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-23 02:36:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-23 02:36:28,912 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2021-11-23 02:36:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:28,912 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-23 02:36:28,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-11-23 02:36:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-23 02:36:28,913 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:28,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-23 02:36:28,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:36:28,914 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 99132598, now seen corresponding path program 1 times [2021-11-23 02:36:28,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137312462] [2021-11-23 02:36:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:28,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:28,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:28,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137312462] [2021-11-23 02:36:28,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137312462] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:28,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:28,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:36:28,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191870406] [2021-11-23 02:36:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:28,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:36:28,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:36:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:36:28,988 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:29,054 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-11-23 02:36:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:36:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-11-23 02:36:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:29,056 INFO L225 Difference]: With dead ends: 35 [2021-11-23 02:36:29,056 INFO L226 Difference]: Without dead ends: 35 [2021-11-23 02:36:29,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:36:29,058 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:29,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:36:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-23 02:36:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2021-11-23 02:36:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-11-23 02:36:29,062 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2021-11-23 02:36:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:29,063 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-23 02:36:29,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-11-23 02:36:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-23 02:36:29,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:29,064 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-11-23 02:36:29,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:36:29,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:29,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 777193832, now seen corresponding path program 1 times [2021-11-23 02:36:29,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:29,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377239386] [2021-11-23 02:36:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:29,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:29,119 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377239386] [2021-11-23 02:36:29,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377239386] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280558163] [2021-11-23 02:36:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:29,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:29,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:29,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:29,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:36:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:29,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:36:29,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:29,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:29,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280558163] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:29,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [470190161] [2021-11-23 02:36:29,397 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2021-11-23 02:36:29,397 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:29,405 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:29,410 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:29,411 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:29,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:29,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:29,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:29,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:29,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:30,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:30,063 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:30,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [470190161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:30,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:30,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3] total 8 [2021-11-23 02:36:30,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038331842] [2021-11-23 02:36:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:30,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:36:30,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:36:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-23 02:36:30,278 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:30,709 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-11-23 02:36:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 02:36:30,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 7 [2021-11-23 02:36:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:30,711 INFO L225 Difference]: With dead ends: 30 [2021-11-23 02:36:30,711 INFO L226 Difference]: Without dead ends: 30 [2021-11-23 02:36:30,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:36:30,712 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:30,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-23 02:36:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2021-11-23 02:36:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2021-11-23 02:36:30,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2021-11-23 02:36:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:30,717 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-11-23 02:36:30,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2021-11-23 02:36:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 02:36:30,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:30,718 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2021-11-23 02:36:30,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:30,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:30,919 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:30,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1676794930, now seen corresponding path program 1 times [2021-11-23 02:36:30,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765674727] [2021-11-23 02:36:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:30,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:36:30,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:30,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765674727] [2021-11-23 02:36:30,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765674727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:30,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:30,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:36:30,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149861137] [2021-11-23 02:36:30,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:30,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:36:30,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:36:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:36:30,988 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:31,073 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2021-11-23 02:36:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:36:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-23 02:36:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:31,074 INFO L225 Difference]: With dead ends: 40 [2021-11-23 02:36:31,074 INFO L226 Difference]: Without dead ends: 40 [2021-11-23 02:36:31,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:36:31,076 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:31,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 14 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-23 02:36:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2021-11-23 02:36:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 24 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) [2021-11-23 02:36:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-11-23 02:36:31,080 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 8 [2021-11-23 02:36:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:31,081 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-11-23 02:36:31,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-11-23 02:36:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:36:31,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:31,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:36:31,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 02:36:31,083 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash -725463176, now seen corresponding path program 1 times [2021-11-23 02:36:31,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074403323] [2021-11-23 02:36:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:31,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:36:31,133 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074403323] [2021-11-23 02:36:31,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074403323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:31,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:36:31,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:36:31,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309004977] [2021-11-23 02:36:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:31,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:36:31,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:36:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:36:31,138 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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) [2021-11-23 02:36:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:31,159 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-11-23 02:36:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:36:31,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 [2021-11-23 02:36:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:31,161 INFO L225 Difference]: With dead ends: 23 [2021-11-23 02:36:31,161 INFO L226 Difference]: Without dead ends: 23 [2021-11-23 02:36:31,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:36:31,162 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:31,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:36:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-23 02:36:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-23 02:36:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4736842105263157) 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) [2021-11-23 02:36:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2021-11-23 02:36:31,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 10 [2021-11-23 02:36:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:31,167 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-11-23 02:36:31,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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) [2021-11-23 02:36:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2021-11-23 02:36:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 02:36:31,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:31,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:36:31,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 02:36:31,170 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -725463175, now seen corresponding path program 1 times [2021-11-23 02:36:31,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:31,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465636747] [2021-11-23 02:36:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:31,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 02:36:31,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465636747] [2021-11-23 02:36:31,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465636747] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816238878] [2021-11-23 02:36:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:31,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:31,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:31,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:36:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:31,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:36:31,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:31,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:31,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816238878] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923784454] [2021-11-23 02:36:31,422 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-11-23 02:36:31,422 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:31,422 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:31,423 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:31,423 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:31,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:31,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:31,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:31,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:31,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:31,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:36:31,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:32,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:32,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:32,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:32,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:32,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:32,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:32,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:32,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:32,498 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:32,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:32,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:32,599 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:32,937 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '624#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:32,938 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:32,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:32,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2021-11-23 02:36:32,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150499895] [2021-11-23 02:36:32,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:32,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:36:32,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:36:32,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:36:32,940 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:33,122 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2021-11-23 02:36:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:36:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-23 02:36:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:33,124 INFO L225 Difference]: With dead ends: 35 [2021-11-23 02:36:33,124 INFO L226 Difference]: Without dead ends: 35 [2021-11-23 02:36:33,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:36:33,125 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:33,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 6 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-23 02:36:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2021-11-23 02:36:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-23 02:36:33,130 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2021-11-23 02:36:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:33,130 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-23 02:36:33,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-23 02:36:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:36:33,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:33,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:36:33,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:33,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:33,343 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1174809817, now seen corresponding path program 1 times [2021-11-23 02:36:33,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:33,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546623171] [2021-11-23 02:36:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:33,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:36:33,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:33,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546623171] [2021-11-23 02:36:33,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546623171] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:33,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639836480] [2021-11-23 02:36:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:33,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:33,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:33,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:33,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:36:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:33,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:36:33,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:36:33,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:36:33,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639836480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:33,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:36:33,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2021-11-23 02:36:33,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951820398] [2021-11-23 02:36:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:33,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:36:33,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:36:33,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:36:33,638 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:33,656 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-11-23 02:36:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:36:33,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-23 02:36:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:33,657 INFO L225 Difference]: With dead ends: 30 [2021-11-23 02:36:33,658 INFO L226 Difference]: Without dead ends: 29 [2021-11-23 02:36:33,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:36:33,659 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:33,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2021-11-23 02:36:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-23 02:36:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-23 02:36:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2021-11-23 02:36:33,663 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2021-11-23 02:36:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:33,663 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-11-23 02:36:33,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2021-11-23 02:36:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 02:36:33,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:33,664 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:36:33,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:33,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:33,879 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:33,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2059371235, now seen corresponding path program 1 times [2021-11-23 02:36:33,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:33,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92266062] [2021-11-23 02:36:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:33,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:36:33,928 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:33,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92266062] [2021-11-23 02:36:33,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92266062] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:33,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423092943] [2021-11-23 02:36:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:33,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:33,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:33,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:33,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:36:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:34,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:36:34,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:34,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 02:36:34,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:36:34,166 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:36:34,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-11-23 02:36:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:34,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:34,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-11-23 02:36:34,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-11-23 02:36:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:36:34,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423092943] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:34,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407197088] [2021-11-23 02:36:34,379 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-23 02:36:34,379 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:34,380 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:34,380 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:34,380 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:34,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:34,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:34,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:34,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:34,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:34,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:34,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:34,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:34,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:34,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:34,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:35,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:35,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:35,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:35,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:35,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:35,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:35,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:35,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:35,358 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:36:35,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2021-11-23 02:36:35,382 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:35,881 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '925#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (exists ((|v_ULTIMATE.start_main_~#mask~0#1.base_20| Int)) (and (<= 0 |v_ULTIMATE.start_main_~#mask~0#1.base_20|) (= (select |#valid| |v_ULTIMATE.start_main_~#mask~0#1.base_20|) 0))) (<= 32 (mod |ULTIMATE.start_main_~i~1#1| 4294967296)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:35,881 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:35,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:35,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2021-11-23 02:36:35,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938152318] [2021-11-23 02:36:35,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:35,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-23 02:36:35,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 02:36:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2021-11-23 02:36:35,884 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:36,115 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2021-11-23 02:36:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:36:36,116 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-23 02:36:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:36,117 INFO L225 Difference]: With dead ends: 47 [2021-11-23 02:36:36,117 INFO L226 Difference]: Without dead ends: 47 [2021-11-23 02:36:36,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-11-23 02:36:36,118 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:36,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 30 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:36:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-23 02:36:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2021-11-23 02:36:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2021-11-23 02:36:36,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2021-11-23 02:36:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:36,122 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2021-11-23 02:36:36,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-11-23 02:36:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 02:36:36,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:36,123 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2021-11-23 02:36:36,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:36,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-23 02:36:36,324 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash -118300012, now seen corresponding path program 1 times [2021-11-23 02:36:36,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296557678] [2021-11-23 02:36:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:36,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:36:36,373 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:36,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296557678] [2021-11-23 02:36:36,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296557678] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:36,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805539880] [2021-11-23 02:36:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:36,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:36,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:36,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:36,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:36:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:36,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:36:36,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:36:36,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:36:36,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805539880] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [223928197] [2021-11-23 02:36:36,515 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:36,516 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:36,516 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:36,516 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:36,516 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:36,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:36,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:36,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:36,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:36,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:36,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:36,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:36,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:36,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:37,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:37,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:37,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:37,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:37,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:37,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:37,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:37,326 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:37,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:37,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:37,405 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:37,714 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1113#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:37,715 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:37,715 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:37,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-11-23 02:36:37,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460277102] [2021-11-23 02:36:37,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:37,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:36:37,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:36:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-23 02:36:37,716 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:37,798 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-11-23 02:36:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:36:37,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-23 02:36:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:37,801 INFO L225 Difference]: With dead ends: 76 [2021-11-23 02:36:37,801 INFO L226 Difference]: Without dead ends: 76 [2021-11-23 02:36:37,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:36:37,802 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:37,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-23 02:36:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 39. [2021-11-23 02:36:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-11-23 02:36:37,810 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 16 [2021-11-23 02:36:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:37,811 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-11-23 02:36:37,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:37,811 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-11-23 02:36:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-23 02:36:37,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:37,812 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1] [2021-11-23 02:36:37,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:38,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-23 02:36:38,019 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1892594115, now seen corresponding path program 1 times [2021-11-23 02:36:38,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:38,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72004510] [2021-11-23 02:36:38,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:38,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:36:38,082 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72004510] [2021-11-23 02:36:38,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72004510] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:38,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538481840] [2021-11-23 02:36:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:38,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:38,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:38,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:38,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:36:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:38,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:36:38,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:36:38,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 02:36:38,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538481840] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [844773593] [2021-11-23 02:36:38,290 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:38,290 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:38,290 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:38,290 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:38,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:38,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:38,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:38,512 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:38,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:36:38,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:38,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:38,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:38,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:38,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:38,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:38,939 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:38,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:38,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:39,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:39,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:39,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:39,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:39,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:39,207 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:39,571 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1357#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (< |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647) (= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_#res#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:39,571 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:39,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:39,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-23 02:36:39,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179120636] [2021-11-23 02:36:39,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:39,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 02:36:39,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 02:36:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:36:39,574 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:39,711 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2021-11-23 02:36:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:36:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-23 02:36:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:39,712 INFO L225 Difference]: With dead ends: 39 [2021-11-23 02:36:39,712 INFO L226 Difference]: Without dead ends: 39 [2021-11-23 02:36:39,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:36:39,714 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:39,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 6 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-23 02:36:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-11-23 02:36:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2021-11-23 02:36:39,718 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 19 [2021-11-23 02:36:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:39,719 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-11-23 02:36:39,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2021-11-23 02:36:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 02:36:39,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:39,720 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1] [2021-11-23 02:36:39,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-23 02:36:39,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:39,927 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2119785853, now seen corresponding path program 2 times [2021-11-23 02:36:39,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:39,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559499093] [2021-11-23 02:36:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:39,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:36:40,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559499093] [2021-11-23 02:36:40,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559499093] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993495909] [2021-11-23 02:36:40,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:36:40,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:40,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:40,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:36:40,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:36:40,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:40,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:36:40,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:40,154 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-23 02:36:40,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-11-23 02:36:40,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-23 02:36:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:36:40,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:36:40,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993495909] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:40,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773118292] [2021-11-23 02:36:40,611 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:40,611 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:40,611 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:40,612 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:40,612 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:40,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:40,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:40,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:40,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:40,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:40,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:40,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:36:40,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:41,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:41,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:41,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:41,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:41,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:41,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:41,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:41,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:41,416 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:41,987 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1589#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (< |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_#res#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:41,987 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:41,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:41,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 8 [2021-11-23 02:36:41,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150255122] [2021-11-23 02:36:41,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:41,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 02:36:41,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 02:36:41,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-23 02:36:41,989 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:42,065 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2021-11-23 02:36:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:36:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-23 02:36:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:42,066 INFO L225 Difference]: With dead ends: 89 [2021-11-23 02:36:42,066 INFO L226 Difference]: Without dead ends: 89 [2021-11-23 02:36:42,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:36:42,068 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:42,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2021-11-23 02:36:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-23 02:36:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2021-11-23 02:36:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 85 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2021-11-23 02:36:42,077 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 22 [2021-11-23 02:36:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:42,078 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2021-11-23 02:36:42,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2021-11-23 02:36:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 02:36:42,079 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:42,079 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1] [2021-11-23 02:36:42,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:42,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 02:36:42,301 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1696599596, now seen corresponding path program 2 times [2021-11-23 02:36:42,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:42,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957043287] [2021-11-23 02:36:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:42,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 02:36:42,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:42,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957043287] [2021-11-23 02:36:42,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957043287] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823646021] [2021-11-23 02:36:42,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:36:42,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:42,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:42,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:36:42,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:36:42,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:42,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:36:42,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:36:42,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:36:42,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823646021] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:42,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69549800] [2021-11-23 02:36:42,690 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:42,690 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:42,691 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:42,691 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:42,691 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:42,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:42,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:42,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:42,866 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:42,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:36:42,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:42,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:43,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:43,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:43,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:43,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:43,259 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:43,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:43,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:43,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:43,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:43,454 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:43,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:43,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:43,529 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:43,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1935#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:43,858 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:43,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:43,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2021-11-23 02:36:43,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001203615] [2021-11-23 02:36:43,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:43,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-23 02:36:43,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 02:36:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-11-23 02:36:43,859 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:44,533 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-11-23 02:36:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-23 02:36:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-23 02:36:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:44,535 INFO L225 Difference]: With dead ends: 142 [2021-11-23 02:36:44,535 INFO L226 Difference]: Without dead ends: 142 [2021-11-23 02:36:44,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=645, Invalid=2217, Unknown=0, NotChecked=0, Total=2862 [2021-11-23 02:36:44,537 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 384 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:44,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 20 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:36:44,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-11-23 02:36:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 74. [2021-11-23 02:36:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-11-23 02:36:44,544 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2021-11-23 02:36:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:44,544 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-11-23 02:36:44,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-11-23 02:36:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 02:36:44,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:44,545 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-23 02:36:44,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:44,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-23 02:36:44,746 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash -934045657, now seen corresponding path program 1 times [2021-11-23 02:36:44,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:44,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053180628] [2021-11-23 02:36:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:44,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 02:36:44,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:44,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053180628] [2021-11-23 02:36:44,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053180628] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:44,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167526624] [2021-11-23 02:36:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:44,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:44,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:44,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:36:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:44,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:36:44,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:36:45,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:45,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-11-23 02:36:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:36:45,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167526624] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:45,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [729680811] [2021-11-23 02:36:45,307 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-23 02:36:45,307 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:45,308 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:45,308 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:45,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:45,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:45,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:45,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:45,493 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:45,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:36:45,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:45,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:45,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:45,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:45,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:45,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:45,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:45,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:45,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:45,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:45,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:46,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:46,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:46,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:46,150 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:46,516 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2392#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (< (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 32) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:46,516 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:46,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:46,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2021-11-23 02:36:46,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898919736] [2021-11-23 02:36:46,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:46,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 02:36:46,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 02:36:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-11-23 02:36:46,518 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:46,703 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2021-11-23 02:36:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:36:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-23 02:36:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:46,704 INFO L225 Difference]: With dead ends: 80 [2021-11-23 02:36:46,705 INFO L226 Difference]: Without dead ends: 80 [2021-11-23 02:36:46,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-11-23 02:36:46,706 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:46,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 35 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-23 02:36:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2021-11-23 02:36:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2021-11-23 02:36:46,711 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 28 [2021-11-23 02:36:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:46,711 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2021-11-23 02:36:46,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2021-11-23 02:36:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 02:36:46,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:46,713 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2021-11-23 02:36:46,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:46,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 02:36:46,927 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1844675833, now seen corresponding path program 2 times [2021-11-23 02:36:46,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:46,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602243196] [2021-11-23 02:36:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:46,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 97 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 02:36:47,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602243196] [2021-11-23 02:36:47,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602243196] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:47,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490151398] [2021-11-23 02:36:47,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:36:47,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:47,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:47,058 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:47,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:36:47,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:36:47,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:47,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-23 02:36:47,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:47,132 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-23 02:36:47,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-11-23 02:36:47,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-11-23 02:36:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-23 02:36:47,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:36:47,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490151398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:47,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:36:47,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 12 [2021-11-23 02:36:47,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689187432] [2021-11-23 02:36:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:47,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:36:47,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:36:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:36:47,599 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:47,603 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-11-23 02:36:47,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:36:47,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 43 [2021-11-23 02:36:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:47,604 INFO L225 Difference]: With dead ends: 76 [2021-11-23 02:36:47,604 INFO L226 Difference]: Without dead ends: 76 [2021-11-23 02:36:47,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:36:47,606 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:47,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2021-11-23 02:36:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-23 02:36:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-11-23 02:36:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2021-11-23 02:36:47,610 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 43 [2021-11-23 02:36:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:47,611 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2021-11-23 02:36:47,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2021-11-23 02:36:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 02:36:47,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:47,613 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2021-11-23 02:36:47,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:47,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 02:36:47,831 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 631207499, now seen corresponding path program 2 times [2021-11-23 02:36:47,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:47,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803996956] [2021-11-23 02:36:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:47,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 97 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:36:47,944 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803996956] [2021-11-23 02:36:47,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803996956] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:47,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538735088] [2021-11-23 02:36:47,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:36:47,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:47,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:47,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 02:36:47,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:36:47,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:47,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 02:36:47,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-11-23 02:36:48,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:36:48,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538735088] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:36:48,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:36:48,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2021-11-23 02:36:48,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220956647] [2021-11-23 02:36:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:36:48,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:36:48,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:36:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:36:48,343 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:48,358 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2021-11-23 02:36:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:36:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-23 02:36:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:48,359 INFO L225 Difference]: With dead ends: 75 [2021-11-23 02:36:48,360 INFO L226 Difference]: Without dead ends: 64 [2021-11-23 02:36:48,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:36:48,361 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:48,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2021-11-23 02:36:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-23 02:36:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-23 02:36:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-11-23 02:36:48,365 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 46 [2021-11-23 02:36:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:48,365 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-11-23 02:36:48,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-11-23 02:36:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-23 02:36:48,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:48,367 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 1, 1] [2021-11-23 02:36:48,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:48,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 02:36:48,582 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash -473819457, now seen corresponding path program 3 times [2021-11-23 02:36:48,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:48,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482170812] [2021-11-23 02:36:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:48,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 197 proven. 97 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-23 02:36:48,678 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:48,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482170812] [2021-11-23 02:36:48,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482170812] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:48,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456434081] [2021-11-23 02:36:48,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:36:48,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:48,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:48,683 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:48,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 02:36:48,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:36:48,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:48,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:36:48,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 224 proven. 70 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-23 02:36:48,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 224 proven. 70 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-11-23 02:36:49,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456434081] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:49,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2141322460] [2021-11-23 02:36:49,074 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:49,074 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:49,075 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:49,075 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:49,075 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:49,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:49,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:49,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:49,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:49,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:49,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:49,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:49,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:49,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:49,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:49,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:49,571 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:49,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:49,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:49,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:49,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:49,751 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:49,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:49,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:49,827 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:50,104 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3498#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (< |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647) (= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_#res#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:50,105 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:50,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:50,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-11-23 02:36:50,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887578427] [2021-11-23 02:36:50,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:50,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 02:36:50,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 02:36:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-11-23 02:36:50,108 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:50,311 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-11-23 02:36:50,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 02:36:50,312 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-23 02:36:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:50,312 INFO L225 Difference]: With dead ends: 75 [2021-11-23 02:36:50,312 INFO L226 Difference]: Without dead ends: 75 [2021-11-23 02:36:50,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:36:50,314 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:50,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-23 02:36:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2021-11-23 02:36:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-11-23 02:36:50,317 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 58 [2021-11-23 02:36:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:50,317 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-11-23 02:36:50,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-11-23 02:36:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-23 02:36:50,328 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:50,328 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 5, 4, 4, 1, 1] [2021-11-23 02:36:50,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-11-23 02:36:50,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:50,547 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -344265536, now seen corresponding path program 3 times [2021-11-23 02:36:50,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:50,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203156325] [2021-11-23 02:36:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:50,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 257 proven. 214 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-23 02:36:50,664 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:50,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203156325] [2021-11-23 02:36:50,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203156325] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:50,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090716494] [2021-11-23 02:36:50,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:36:50,665 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:50,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:50,668 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:50,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 02:36:50,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:36:50,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:50,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-23 02:36:50,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 317 proven. 154 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-23 02:36:50,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 317 proven. 154 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-11-23 02:36:51,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090716494] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:51,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695603276] [2021-11-23 02:36:51,125 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:51,125 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:51,126 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:51,126 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:51,126 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:51,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:51,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:51,300 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:51,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:36:51,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:36:51,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:51,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:51,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:51,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:51,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:51,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:51,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:51,928 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:52,203 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4083#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:52,203 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:52,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:52,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2021-11-23 02:36:52,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980321913] [2021-11-23 02:36:52,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:52,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-23 02:36:52,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:52,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-23 02:36:52,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2021-11-23 02:36:52,205 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:52,482 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-11-23 02:36:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-23 02:36:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-23 02:36:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:52,485 INFO L225 Difference]: With dead ends: 80 [2021-11-23 02:36:52,485 INFO L226 Difference]: Without dead ends: 80 [2021-11-23 02:36:52,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1225, Unknown=0, NotChecked=0, Total=1560 [2021-11-23 02:36:52,487 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:52,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-23 02:36:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2021-11-23 02:36:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-11-23 02:36:52,498 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 67 [2021-11-23 02:36:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:52,498 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-11-23 02:36:52,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-11-23 02:36:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 02:36:52,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:52,503 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 18, 5, 4, 4, 1, 1] [2021-11-23 02:36:52,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:52,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:52,719 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -539164032, now seen corresponding path program 4 times [2021-11-23 02:36:52,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:52,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162487089] [2021-11-23 02:36:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:52,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 216 proven. 26 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-23 02:36:52,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:52,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162487089] [2021-11-23 02:36:52,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162487089] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:52,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767030065] [2021-11-23 02:36:52,828 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:36:52,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:52,835 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:52,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:36:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:52,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-23 02:36:52,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 216 proven. 26 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-23 02:36:53,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 216 proven. 26 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2021-11-23 02:36:53,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767030065] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1073789995] [2021-11-23 02:36:53,238 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:53,238 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:53,238 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:53,238 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:53,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:53,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:53,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:53,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:53,391 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:53,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:36:53,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:53,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:53,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:53,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:53,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:53,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:53,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:53,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:53,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:53,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:53,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:53,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:53,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:54,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:54,046 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:54,344 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4702#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:54,344 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:54,344 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:54,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-23 02:36:54,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306247787] [2021-11-23 02:36:54,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:54,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-23 02:36:54,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-23 02:36:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-11-23 02:36:54,346 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:54,536 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2021-11-23 02:36:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:36:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-23 02:36:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:54,538 INFO L225 Difference]: With dead ends: 158 [2021-11-23 02:36:54,538 INFO L226 Difference]: Without dead ends: 158 [2021-11-23 02:36:54,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2021-11-23 02:36:54,539 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 77 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:54,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 16 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:36:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-23 02:36:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 91. [2021-11-23 02:36:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-11-23 02:36:54,544 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 70 [2021-11-23 02:36:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:54,544 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-11-23 02:36:54,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-11-23 02:36:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 02:36:54,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:54,545 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 5, 5, 4, 1, 1] [2021-11-23 02:36:54,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:54,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-23 02:36:54,758 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 942111319, now seen corresponding path program 4 times [2021-11-23 02:36:54,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843689451] [2021-11-23 02:36:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:54,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 181 proven. 383 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-23 02:36:54,928 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:54,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843689451] [2021-11-23 02:36:54,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843689451] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:54,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066326371] [2021-11-23 02:36:54,929 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:36:54,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:54,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:54,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 02:36:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:54,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:36:54,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 281 proven. 283 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-23 02:36:55,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 281 proven. 283 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-23 02:36:55,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066326371] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [595832958] [2021-11-23 02:36:55,333 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:55,333 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:55,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:55,333 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:55,334 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:55,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:55,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:55,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:55,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:55,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:36:55,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:55,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:55,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:55,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:55,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:55,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:55,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:55,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:55,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:55,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:55,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:55,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:55,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:56,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:56,072 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:56,401 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5422#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (< |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647) (= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_#res#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:56,401 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:56,401 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:56,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2021-11-23 02:36:56,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518629771] [2021-11-23 02:36:56,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:56,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-23 02:36:56,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:56,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-23 02:36:56,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2021-11-23 02:36:56,404 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:36:56,810 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2021-11-23 02:36:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-23 02:36:56,814 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 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 73 [2021-11-23 02:36:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:36:56,815 INFO L225 Difference]: With dead ends: 91 [2021-11-23 02:36:56,815 INFO L226 Difference]: Without dead ends: 91 [2021-11-23 02:36:56,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=1783, Unknown=0, NotChecked=0, Total=2256 [2021-11-23 02:36:56,816 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:36:56,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:36:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-11-23 02:36:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-11-23 02:36:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.101123595505618) internal successors, (98), 90 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-11-23 02:36:56,819 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 73 [2021-11-23 02:36:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:36:56,820 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-11-23 02:36:56,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 20 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:36:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-11-23 02:36:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-23 02:36:56,821 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:36:56,821 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 5, 5, 4, 1, 1] [2021-11-23 02:36:56,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:36:57,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-23 02:36:57,047 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:36:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:36:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1233378961, now seen corresponding path program 5 times [2021-11-23 02:36:57,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:36:57,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699054079] [2021-11-23 02:36:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:36:57,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:36:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:36:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 575 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2021-11-23 02:36:57,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:36:57,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699054079] [2021-11-23 02:36:57,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699054079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:36:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64101969] [2021-11-23 02:36:57,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:36:57,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:36:57,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:36:57,275 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:36:57,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 02:36:57,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:36:57,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:36:57,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:36:57,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:36:57,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-11-23 02:36:57,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 15 proven. 298 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2021-11-23 02:36:58,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:36:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2021-11-23 02:36:58,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64101969] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:36:58,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [413396256] [2021-11-23 02:36:58,790 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:36:58,790 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:36:58,791 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:36:58,791 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:36:58,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:36:58,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:58,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:36:58,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:58,958 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:58,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:36:59,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:59,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:36:59,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:59,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:59,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:59,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:36:59,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:36:59,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:59,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:36:59,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:36:59,485 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:36:59,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:36:59,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:36:59,572 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:36:59,912 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6122#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (< |ULTIMATE.start_foo_~size#1| |ULTIMATE.start_foo_~i~0#1|) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* 4 |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~#b~0#1.offset| 4)) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647) (= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_#res#1|) (<= 1 |ULTIMATE.start_foo_~size#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:36:59,912 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:36:59,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:36:59,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2021-11-23 02:36:59,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781059297] [2021-11-23 02:36:59,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:36:59,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-23 02:36:59,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:36:59,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-23 02:36:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2021-11-23 02:36:59,915 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:00,769 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2021-11-23 02:37:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-23 02:37:00,769 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-23 02:37:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:00,770 INFO L225 Difference]: With dead ends: 125 [2021-11-23 02:37:00,770 INFO L226 Difference]: Without dead ends: 125 [2021-11-23 02:37:00,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=517, Invalid=2033, Unknown=0, NotChecked=0, Total=2550 [2021-11-23 02:37:00,772 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 57 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:00,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 51 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2021-11-23 02:37:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-23 02:37:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2021-11-23 02:37:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-11-23 02:37:00,776 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 76 [2021-11-23 02:37:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:00,776 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-11-23 02:37:00,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-11-23 02:37:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 02:37:00,778 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:00,778 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 24, 5, 4, 4, 1, 1] [2021-11-23 02:37:00,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:00,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:00,991 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:00,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:00,991 INFO L85 PathProgramCache]: Analyzing trace with hash 786597760, now seen corresponding path program 5 times [2021-11-23 02:37:00,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:00,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632762887] [2021-11-23 02:37:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:00,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 64 proven. 834 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-11-23 02:37:01,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:01,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632762887] [2021-11-23 02:37:01,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632762887] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:01,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798212878] [2021-11-23 02:37:01,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:37:01,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:01,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:01,155 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:01,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:37:01,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-23 02:37:01,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:37:01,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:37:01,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 509 proven. 216 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2021-11-23 02:37:01,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 490 proven. 235 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2021-11-23 02:37:01,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798212878] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1667034314] [2021-11-23 02:37:01,991 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:01,991 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:01,991 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:01,991 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:01,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:02,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:02,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:02,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:02,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:02,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:37:02,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:02,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:02,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:02,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:02,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:02,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:02,448 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:02,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:37:02,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:02,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:02,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:02,614 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:02,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:37:02,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:02,702 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:03,041 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6955#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:03,041 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:03,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:03,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2021-11-23 02:37:03,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173857433] [2021-11-23 02:37:03,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:03,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-23 02:37:03,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-23 02:37:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2021-11-23 02:37:03,044 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 36 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:05,707 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2021-11-23 02:37:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-23 02:37:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 36 states have internal predecessors, (102), 0 states have call successors, (0), 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 88 [2021-11-23 02:37:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:05,709 INFO L225 Difference]: With dead ends: 195 [2021-11-23 02:37:05,710 INFO L226 Difference]: Without dead ends: 195 [2021-11-23 02:37:05,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3231, Invalid=10341, Unknown=0, NotChecked=0, Total=13572 [2021-11-23 02:37:05,715 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:05,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:37:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-23 02:37:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 175. [2021-11-23 02:37:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.0977011494252873) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2021-11-23 02:37:05,722 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 88 [2021-11-23 02:37:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:05,723 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2021-11-23 02:37:05,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.8333333333333335) internal successors, (102), 36 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2021-11-23 02:37:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-23 02:37:05,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:05,726 INFO L514 BasicCegarLoop]: trace histogram [49, 48, 48, 8, 7, 7, 1, 1] [2021-11-23 02:37:05,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:05,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:05,944 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -354852524, now seen corresponding path program 6 times [2021-11-23 02:37:05,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:05,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248870120] [2021-11-23 02:37:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:05,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 2393 proven. 613 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2021-11-23 02:37:06,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248870120] [2021-11-23 02:37:06,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248870120] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982339227] [2021-11-23 02:37:06,189 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:37:06,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:06,190 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:06,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 02:37:06,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:37:06,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:37:06,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:37:06,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 193 proven. 3314 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-23 02:37:07,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 193 proven. 3314 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2021-11-23 02:37:07,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982339227] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:07,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1177431447] [2021-11-23 02:37:07,718 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:07,718 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:07,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:07,718 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:07,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:07,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:07,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:07,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:07,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:37:07,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:07,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:37:08,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:08,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:08,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:08,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:08,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:08,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:37:08,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:08,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:08,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:08,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:08,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:37:08,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:08,368 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:08,753 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8535#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:08,753 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:08,753 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:08,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 20] total 45 [2021-11-23 02:37:08,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644953916] [2021-11-23 02:37:08,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:08,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-23 02:37:08,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-23 02:37:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2264, Unknown=0, NotChecked=0, Total=2652 [2021-11-23 02:37:08,756 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 46 states, 46 states have (on average 3.739130434782609) internal successors, (172), 45 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:10,884 INFO L93 Difference]: Finished difference Result 275 states and 294 transitions. [2021-11-23 02:37:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-11-23 02:37:10,884 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.739130434782609) internal successors, (172), 45 states have internal predecessors, (172), 0 states have call successors, (0), 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 169 [2021-11-23 02:37:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:10,886 INFO L225 Difference]: With dead ends: 275 [2021-11-23 02:37:10,886 INFO L226 Difference]: Without dead ends: 275 [2021-11-23 02:37:10,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5820 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2799, Invalid=16661, Unknown=0, NotChecked=0, Total=19460 [2021-11-23 02:37:10,894 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 344 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:10,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 0 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:37:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-23 02:37:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2021-11-23 02:37:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.0749063670411985) internal successors, (287), 267 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 287 transitions. [2021-11-23 02:37:10,902 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 287 transitions. Word has length 169 [2021-11-23 02:37:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:10,902 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 287 transitions. [2021-11-23 02:37:10,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.739130434782609) internal successors, (172), 45 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 287 transitions. [2021-11-23 02:37:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-11-23 02:37:10,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:10,906 INFO L514 BasicCegarLoop]: trace histogram [71, 70, 70, 11, 10, 10, 1, 1] [2021-11-23 02:37:10,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:11,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-23 02:37:11,131 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 847639632, now seen corresponding path program 7 times [2021-11-23 02:37:11,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:11,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285884682] [2021-11-23 02:37:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:11,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8240 backedges. 5044 proven. 913 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-11-23 02:37:11,395 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285884682] [2021-11-23 02:37:11,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285884682] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856839965] [2021-11-23 02:37:11,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:37:11,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:11,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:11,403 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:11,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-23 02:37:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:11,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:37:11,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8240 backedges. 5245 proven. 712 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-11-23 02:37:12,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8240 backedges. 5245 proven. 712 refuted. 0 times theorem prover too weak. 2283 trivial. 0 not checked. [2021-11-23 02:37:12,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856839965] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:12,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780723415] [2021-11-23 02:37:12,650 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:12,650 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:12,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:12,650 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:12,651 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:12,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:12,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:12,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:12,832 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:12,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:37:12,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:12,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:37:13,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:13,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:13,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:13,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:13,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:13,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:13,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:13,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:13,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:13,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:13,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:13,405 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:13,704 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10745#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:13,704 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:13,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:13,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 26 [2021-11-23 02:37:13,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446617891] [2021-11-23 02:37:13,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:13,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-23 02:37:13,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:13,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-23 02:37:13,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2021-11-23 02:37:13,707 INFO L87 Difference]: Start difference. First operand 268 states and 287 transitions. Second operand has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:14,325 INFO L93 Difference]: Finished difference Result 268 states and 282 transitions. [2021-11-23 02:37:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-23 02:37:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 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 244 [2021-11-23 02:37:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:14,327 INFO L225 Difference]: With dead ends: 268 [2021-11-23 02:37:14,327 INFO L226 Difference]: Without dead ends: 268 [2021-11-23 02:37:14,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1041, Invalid=3651, Unknown=0, NotChecked=0, Total=4692 [2021-11-23 02:37:14,329 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:14,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:37:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-23 02:37:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-11-23 02:37:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.0561797752808988) internal successors, (282), 267 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 282 transitions. [2021-11-23 02:37:14,337 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 282 transitions. Word has length 244 [2021-11-23 02:37:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:14,337 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 282 transitions. [2021-11-23 02:37:14,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 282 transitions. [2021-11-23 02:37:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-23 02:37:14,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:14,341 INFO L514 BasicCegarLoop]: trace histogram [74, 73, 73, 11, 10, 10, 1, 1] [2021-11-23 02:37:14,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:14,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 02:37:14,567 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 11748416, now seen corresponding path program 8 times [2021-11-23 02:37:14,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:14,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809163229] [2021-11-23 02:37:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:14,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8915 backedges. 5902 proven. 1292 refuted. 0 times theorem prover too weak. 1721 trivial. 0 not checked. [2021-11-23 02:37:14,878 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:14,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809163229] [2021-11-23 02:37:14,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809163229] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119274141] [2021-11-23 02:37:14,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:37:14,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:14,880 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:14,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-23 02:37:15,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-23 02:37:15,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:37:15,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:37:15,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8915 backedges. 2126 proven. 155 refuted. 0 times theorem prover too weak. 6634 trivial. 0 not checked. [2021-11-23 02:37:15,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8915 backedges. 2126 proven. 155 refuted. 0 times theorem prover too weak. 6634 trivial. 0 not checked. [2021-11-23 02:37:16,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119274141] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [343444926] [2021-11-23 02:37:16,207 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:16,207 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:16,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:16,208 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:16,208 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:16,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:16,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:16,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:16,375 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:16,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:37:16,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:16,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:16,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:16,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:16,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:16,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:16,752 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:16,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:37:16,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:16,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:16,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:16,926 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:16,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:37:16,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:17,002 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:17,326 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12914#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:17,326 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:17,326 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:17,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 43 [2021-11-23 02:37:17,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033368752] [2021-11-23 02:37:17,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:17,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-11-23 02:37:17,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-11-23 02:37:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2021-11-23 02:37:17,329 INFO L87 Difference]: Start difference. First operand 268 states and 282 transitions. Second operand has 43 states, 43 states have (on average 3.4651162790697674) internal successors, (149), 43 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:19,796 INFO L93 Difference]: Finished difference Result 354 states and 383 transitions. [2021-11-23 02:37:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-11-23 02:37:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.4651162790697674) internal successors, (149), 43 states have internal predecessors, (149), 0 states have call successors, (0), 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 253 [2021-11-23 02:37:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:19,799 INFO L225 Difference]: With dead ends: 354 [2021-11-23 02:37:19,799 INFO L226 Difference]: Without dead ends: 354 [2021-11-23 02:37:19,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4863 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3663, Invalid=14159, Unknown=0, NotChecked=0, Total=17822 [2021-11-23 02:37:19,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:19,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:37:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-23 02:37:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 299. [2021-11-23 02:37:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.0671140939597314) internal successors, (318), 298 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 318 transitions. [2021-11-23 02:37:19,811 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 318 transitions. Word has length 253 [2021-11-23 02:37:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:19,812 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 318 transitions. [2021-11-23 02:37:19,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.4651162790697674) internal successors, (149), 43 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 318 transitions. [2021-11-23 02:37:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2021-11-23 02:37:19,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:19,816 INFO L514 BasicCegarLoop]: trace histogram [88, 87, 87, 11, 10, 10, 1, 1] [2021-11-23 02:37:19,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:20,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:20,043 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1970660376, now seen corresponding path program 9 times [2021-11-23 02:37:20,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:20,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781035154] [2021-11-23 02:37:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:20,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12422 backedges. 8471 proven. 1759 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2021-11-23 02:37:20,428 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:20,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781035154] [2021-11-23 02:37:20,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781035154] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:20,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089271890] [2021-11-23 02:37:20,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:37:20,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:20,435 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:20,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 02:37:21,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:37:21,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:37:21,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:37:21,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12422 backedges. 8801 proven. 1429 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2021-11-23 02:37:22,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12422 backedges. 8801 proven. 1429 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2021-11-23 02:37:23,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089271890] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:23,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105383610] [2021-11-23 02:37:23,117 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:23,117 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:23,117 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:23,117 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:23,118 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:23,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:23,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:23,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:23,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:37:23,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:37:23,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:23,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:23,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:23,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:23,765 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:24,274 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15541#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:24,274 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:24,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:24,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 32 [2021-11-23 02:37:24,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275240132] [2021-11-23 02:37:24,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:24,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-23 02:37:24,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:24,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-23 02:37:24,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2021-11-23 02:37:24,277 INFO L87 Difference]: Start difference. First operand 299 states and 318 transitions. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:25,306 INFO L93 Difference]: Finished difference Result 299 states and 315 transitions. [2021-11-23 02:37:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-23 02:37:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 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 295 [2021-11-23 02:37:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:25,309 INFO L225 Difference]: With dead ends: 299 [2021-11-23 02:37:25,309 INFO L226 Difference]: Without dead ends: 299 [2021-11-23 02:37:25,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2581 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2046, Invalid=6696, Unknown=0, NotChecked=0, Total=8742 [2021-11-23 02:37:25,311 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:25,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:37:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-23 02:37:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-11-23 02:37:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.0570469798657718) internal successors, (315), 298 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 315 transitions. [2021-11-23 02:37:25,319 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 315 transitions. Word has length 295 [2021-11-23 02:37:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:25,320 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 315 transitions. [2021-11-23 02:37:25,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 315 transitions. [2021-11-23 02:37:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-11-23 02:37:25,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:25,322 INFO L514 BasicCegarLoop]: trace histogram [89, 88, 88, 11, 10, 10, 1, 1] [2021-11-23 02:37:25,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:25,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-23 02:37:25,527 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash 47435008, now seen corresponding path program 10 times [2021-11-23 02:37:25,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:25,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728947442] [2021-11-23 02:37:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:25,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12695 backedges. 5019 proven. 6322 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2021-11-23 02:37:25,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:25,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728947442] [2021-11-23 02:37:25,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728947442] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:25,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429007922] [2021-11-23 02:37:25,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:37:25,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:25,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:25,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:25,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-23 02:37:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:26,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:37:26,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12695 backedges. 5050 proven. 6291 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2021-11-23 02:37:26,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12695 backedges. 5050 proven. 6291 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2021-11-23 02:37:27,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429007922] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:27,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1262033930] [2021-11-23 02:37:27,421 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:27,421 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:27,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:27,421 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:27,422 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:27,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:27,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:27,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:27,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:27,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:37:27,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:27,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:27,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:27,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:27,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:27,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:27,881 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:27,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:37:27,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:27,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:27,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:28,025 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:28,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:37:28,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:28,086 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:28,428 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18075#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:28,429 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:28,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:28,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 37 [2021-11-23 02:37:28,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382927102] [2021-11-23 02:37:28,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:28,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-23 02:37:28,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-23 02:37:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2021-11-23 02:37:28,432 INFO L87 Difference]: Start difference. First operand 299 states and 315 transitions. Second operand has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 37 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:30,202 INFO L93 Difference]: Finished difference Result 339 states and 356 transitions. [2021-11-23 02:37:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-11-23 02:37:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 37 states have internal predecessors, (143), 0 states have call successors, (0), 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 298 [2021-11-23 02:37:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:30,205 INFO L225 Difference]: With dead ends: 339 [2021-11-23 02:37:30,205 INFO L226 Difference]: Without dead ends: 339 [2021-11-23 02:37:30,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 872 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5639 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3304, Invalid=13208, Unknown=0, NotChecked=0, Total=16512 [2021-11-23 02:37:30,208 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 110 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:30,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 6 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:37:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-11-23 02:37:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2021-11-23 02:37:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.0538922155688624) internal successors, (352), 334 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 352 transitions. [2021-11-23 02:37:30,217 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 352 transitions. Word has length 298 [2021-11-23 02:37:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:30,217 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 352 transitions. [2021-11-23 02:37:30,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 37 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 352 transitions. [2021-11-23 02:37:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-11-23 02:37:30,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:30,220 INFO L514 BasicCegarLoop]: trace histogram [99, 98, 98, 12, 11, 11, 1, 1] [2021-11-23 02:37:30,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:30,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 02:37:30,420 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:30,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash -806450604, now seen corresponding path program 11 times [2021-11-23 02:37:30,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:30,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042609249] [2021-11-23 02:37:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:30,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15720 backedges. 11060 proven. 2323 refuted. 0 times theorem prover too weak. 2337 trivial. 0 not checked. [2021-11-23 02:37:30,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:30,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042609249] [2021-11-23 02:37:30,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042609249] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138634566] [2021-11-23 02:37:30,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:37:30,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:30,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:30,797 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:30,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-23 02:37:31,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-23 02:37:31,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:37:31,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:37:31,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15720 backedges. 7144 proven. 1071 refuted. 0 times theorem prover too weak. 7505 trivial. 0 not checked. [2021-11-23 02:37:31,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15720 backedges. 7101 proven. 1114 refuted. 0 times theorem prover too weak. 7505 trivial. 0 not checked. [2021-11-23 02:37:32,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138634566] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:32,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [170360003] [2021-11-23 02:37:32,942 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:32,942 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:32,942 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:32,943 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:32,943 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:32,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:32,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:33,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:33,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:37:33,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:37:33,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:33,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:33,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:33,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:33,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:33,711 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:34,136 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '20966#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:34,137 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:34,137 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:34,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 61 [2021-11-23 02:37:34,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958737383] [2021-11-23 02:37:34,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:34,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-11-23 02:37:34,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:34,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-11-23 02:37:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=3711, Unknown=0, NotChecked=0, Total=4422 [2021-11-23 02:37:34,140 INFO L87 Difference]: Start difference. First operand 335 states and 352 transitions. Second operand has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:37:43,724 INFO L93 Difference]: Finished difference Result 581 states and 640 transitions. [2021-11-23 02:37:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2021-11-23 02:37:43,725 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2021-11-23 02:37:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:37:43,728 INFO L225 Difference]: With dead ends: 581 [2021-11-23 02:37:43,728 INFO L226 Difference]: Without dead ends: 581 [2021-11-23 02:37:43,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1234 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27370 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15636, Invalid=64736, Unknown=0, NotChecked=0, Total=80372 [2021-11-23 02:37:43,737 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1122 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 716 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 716 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:37:43,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1122 Valid, 0 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [716 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-23 02:37:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-11-23 02:37:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 472. [2021-11-23 02:37:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.089171974522293) internal successors, (513), 471 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 513 transitions. [2021-11-23 02:37:43,749 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 513 transitions. Word has length 331 [2021-11-23 02:37:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:37:43,750 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 513 transitions. [2021-11-23 02:37:43,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 3.19672131147541) internal successors, (195), 61 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:37:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 513 transitions. [2021-11-23 02:37:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-11-23 02:37:43,753 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:37:43,754 INFO L514 BasicCegarLoop]: trace histogram [140, 139, 139, 14, 13, 13, 1, 1] [2021-11-23 02:37:43,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-23 02:37:43,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:43,975 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:37:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:37:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -211260100, now seen corresponding path program 12 times [2021-11-23 02:37:43,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:37:43,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074401847] [2021-11-23 02:37:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:37:43,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:37:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:37:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 31118 backedges. 15584 proven. 8879 refuted. 0 times theorem prover too weak. 6655 trivial. 0 not checked. [2021-11-23 02:37:44,502 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:37:44,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074401847] [2021-11-23 02:37:44,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074401847] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:37:44,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341168977] [2021-11-23 02:37:44,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:37:44,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:37:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:37:44,507 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:37:44,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-23 02:37:46,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:37:46,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:37:46,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-23 02:37:46,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:37:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 31118 backedges. 9498 proven. 19596 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2021-11-23 02:37:47,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:37:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31118 backedges. 9498 proven. 19596 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2021-11-23 02:37:49,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341168977] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:37:49,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [692135059] [2021-11-23 02:37:49,049 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:37:49,049 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:37:49,049 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:37:49,049 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:37:49,050 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:37:49,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:37:49,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:37:49,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:49,215 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:37:49,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:37:49,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:37:49,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:49,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:49,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:37:49,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:37:49,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:37:49,786 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:37:50,507 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '25297#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:37:50,507 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:37:50,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:37:50,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 40, 40] total 79 [2021-11-23 02:37:50,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999854923] [2021-11-23 02:37:50,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:37:50,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-11-23 02:37:50,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:37:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-11-23 02:37:50,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=5568, Unknown=0, NotChecked=0, Total=7310 [2021-11-23 02:37:50,510 INFO L87 Difference]: Start difference. First operand 472 states and 513 transitions. Second operand has 80 states, 80 states have (on average 3.9) internal successors, (312), 79 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:38:02,474 INFO L93 Difference]: Finished difference Result 2735 states and 3082 transitions. [2021-11-23 02:38:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-11-23 02:38:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 3.9) internal successors, (312), 79 states have internal predecessors, (312), 0 states have call successors, (0), 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 460 [2021-11-23 02:38:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:38:02,488 INFO L225 Difference]: With dead ends: 2735 [2021-11-23 02:38:02,488 INFO L226 Difference]: Without dead ends: 2735 [2021-11-23 02:38:02,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1770 GetRequests, 1318 SyntacticMatches, 1 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112226 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=58847, Invalid=145909, Unknown=0, NotChecked=0, Total=204756 [2021-11-23 02:38:02,503 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 227 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:38:02,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 6 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-23 02:38:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2021-11-23 02:38:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 1369. [2021-11-23 02:38:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.1176900584795322) internal successors, (1529), 1368 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1529 transitions. [2021-11-23 02:38:02,543 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1529 transitions. Word has length 460 [2021-11-23 02:38:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:38:02,544 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1529 transitions. [2021-11-23 02:38:02,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 3.9) internal successors, (312), 79 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1529 transitions. [2021-11-23 02:38:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2021-11-23 02:38:02,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:38:02,554 INFO L514 BasicCegarLoop]: trace histogram [272, 271, 271, 26, 25, 25, 1, 1] [2021-11-23 02:38:02,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-23 02:38:02,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-23 02:38:02,771 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:38:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:38:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2035304916, now seen corresponding path program 13 times [2021-11-23 02:38:02,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:38:02,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795169525] [2021-11-23 02:38:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:02,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:38:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 118022 backedges. 54124 proven. 2993 refuted. 0 times theorem prover too weak. 60905 trivial. 0 not checked. [2021-11-23 02:38:03,701 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:38:03,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795169525] [2021-11-23 02:38:03,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795169525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:38:03,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935848861] [2021-11-23 02:38:03,702 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:38:03,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:38:03,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:38:03,703 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:38:03,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-23 02:38:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:04,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 3478 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:38:04,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 118022 backedges. 54611 proven. 2506 refuted. 0 times theorem prover too weak. 60905 trivial. 0 not checked. [2021-11-23 02:38:05,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:38:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 118022 backedges. 54611 proven. 2506 refuted. 0 times theorem prover too weak. 60905 trivial. 0 not checked. [2021-11-23 02:38:07,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935848861] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:07,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552846808] [2021-11-23 02:38:07,288 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:38:07,288 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:38:07,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:38:07,289 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:38:07,289 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:38:07,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:07,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:38:07,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:07,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:07,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:38:07,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:07,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:07,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:07,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:07,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:07,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:38:07,757 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:38:07,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:38:07,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:07,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:07,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:38:07,906 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:38:07,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:38:07,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:07,995 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:38:08,392 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '35526#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:38:08,393 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:38:08,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:38:08,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 38 [2021-11-23 02:38:08,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697762536] [2021-11-23 02:38:08,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:38:08,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-23 02:38:08,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:38:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-23 02:38:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1583, Unknown=0, NotChecked=0, Total=1980 [2021-11-23 02:38:08,399 INFO L87 Difference]: Start difference. First operand 1369 states and 1529 transitions. Second operand has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 38 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:38:09,941 INFO L93 Difference]: Finished difference Result 1369 states and 1510 transitions. [2021-11-23 02:38:09,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-11-23 02:38:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 38 states have internal predecessors, (149), 0 states have call successors, (0), 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 892 [2021-11-23 02:38:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:38:09,948 INFO L225 Difference]: With dead ends: 1369 [2021-11-23 02:38:09,948 INFO L226 Difference]: Without dead ends: 1369 [2021-11-23 02:38:09,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2776 GetRequests, 2655 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4578 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3673, Invalid=11333, Unknown=0, NotChecked=0, Total=15006 [2021-11-23 02:38:09,951 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:38:09,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:38:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2021-11-23 02:38:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2021-11-23 02:38:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.1038011695906433) internal successors, (1510), 1368 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1510 transitions. [2021-11-23 02:38:09,981 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1510 transitions. Word has length 892 [2021-11-23 02:38:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:38:09,982 INFO L470 AbstractCegarLoop]: Abstraction has 1369 states and 1510 transitions. [2021-11-23 02:38:09,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 38 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1510 transitions. [2021-11-23 02:38:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2021-11-23 02:38:09,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:38:09,992 INFO L514 BasicCegarLoop]: trace histogram [284, 283, 283, 26, 25, 25, 1, 1] [2021-11-23 02:38:10,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-23 02:38:10,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-23 02:38:10,207 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:38:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:38:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 492508220, now seen corresponding path program 14 times [2021-11-23 02:38:10,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:38:10,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886530163] [2021-11-23 02:38:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:10,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:38:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 128300 backedges. 64241 proven. 3778 refuted. 0 times theorem prover too weak. 60281 trivial. 0 not checked. [2021-11-23 02:38:11,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:38:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886530163] [2021-11-23 02:38:11,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886530163] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:38:11,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426302417] [2021-11-23 02:38:11,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:38:11,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:38:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:38:11,131 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:38:11,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-23 02:38:11,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-23 02:38:11,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:38:11,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:38:11,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 128300 backedges. 43123 proven. 4023 refuted. 0 times theorem prover too weak. 81154 trivial. 0 not checked. [2021-11-23 02:38:13,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:38:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 128300 backedges. 43080 proven. 4066 refuted. 0 times theorem prover too weak. 81154 trivial. 0 not checked. [2021-11-23 02:38:14,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426302417] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:14,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683616781] [2021-11-23 02:38:14,944 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:38:14,945 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:38:14,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:38:14,945 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:38:14,945 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:38:14,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:14,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:38:14,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:38:15,071 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:38:15,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:38:15,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:15,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:15,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:15,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:38:15,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:15,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:15,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:38:15,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:15,599 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:38:16,029 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '44057#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:38:16,029 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:38:16,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:38:16,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 69 [2021-11-23 02:38:16,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663942733] [2021-11-23 02:38:16,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:38:16,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-11-23 02:38:16,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:38:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-11-23 02:38:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=4674, Unknown=0, NotChecked=0, Total=5550 [2021-11-23 02:38:16,032 INFO L87 Difference]: Start difference. First operand 1369 states and 1510 transitions. Second operand has 69 states, 69 states have (on average 3.347826086956522) internal successors, (231), 69 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:38:33,025 INFO L93 Difference]: Finished difference Result 3825 states and 4261 transitions. [2021-11-23 02:38:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 319 states. [2021-11-23 02:38:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.347826086956522) internal successors, (231), 69 states have internal predecessors, (231), 0 states have call successors, (0), 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 928 [2021-11-23 02:38:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:38:33,041 INFO L225 Difference]: With dead ends: 3825 [2021-11-23 02:38:33,041 INFO L226 Difference]: Without dead ends: 3825 [2021-11-23 02:38:33,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3129 GetRequests, 2741 SyntacticMatches, 0 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56022 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=29108, Invalid=122602, Unknown=0, NotChecked=0, Total=151710 [2021-11-23 02:38:33,050 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1829 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 1168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1168 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:38:33,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1829 Valid, 0 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1168 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-23 02:38:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2021-11-23 02:38:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 1672. [2021-11-23 02:38:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.1035308198683422) internal successors, (1844), 1671 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1844 transitions. [2021-11-23 02:38:33,101 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1844 transitions. Word has length 928 [2021-11-23 02:38:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:38:33,101 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 1844 transitions. [2021-11-23 02:38:33,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.347826086956522) internal successors, (231), 69 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1844 transitions. [2021-11-23 02:38:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2021-11-23 02:38:33,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:38:33,115 INFO L514 BasicCegarLoop]: trace histogram [328, 327, 327, 27, 26, 26, 1, 1] [2021-11-23 02:38:33,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-23 02:38:33,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:38:33,339 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:38:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:38:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1249661560, now seen corresponding path program 15 times [2021-11-23 02:38:33,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:38:33,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57382349] [2021-11-23 02:38:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:33,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:38:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 170086 backedges. 85656 proven. 4687 refuted. 0 times theorem prover too weak. 79743 trivial. 0 not checked. [2021-11-23 02:38:34,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:38:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57382349] [2021-11-23 02:38:34,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57382349] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:38:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933586593] [2021-11-23 02:38:34,569 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:38:34,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:38:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:38:34,575 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:38:34,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-23 02:38:44,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:38:44,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:38:44,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 4067 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-23 02:38:44,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 170086 backedges. 121603 proven. 6685 refuted. 0 times theorem prover too weak. 41798 trivial. 0 not checked. [2021-11-23 02:38:46,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:38:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 170086 backedges. 121603 proven. 6685 refuted. 0 times theorem prover too weak. 41798 trivial. 0 not checked. [2021-11-23 02:38:48,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933586593] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:48,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1302429311] [2021-11-23 02:38:48,252 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:38:48,252 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:38:48,253 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:38:48,253 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:38:48,253 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:38:48,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:48,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:38:48,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:48,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:48,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:38:48,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:48,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:48,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:38:48,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:48,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:48,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:38:48,750 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:38:48,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:38:48,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:48,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:48,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:48,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:48,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:38:48,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:48,964 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:38:49,304 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '56623#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:38:49,304 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:38:49,304 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:38:49,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 33, 33] total 54 [2021-11-23 02:38:49,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657827728] [2021-11-23 02:38:49,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:38:49,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-23 02:38:49,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:38:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-23 02:38:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=2876, Unknown=0, NotChecked=0, Total=3660 [2021-11-23 02:38:49,308 INFO L87 Difference]: Start difference. First operand 1672 states and 1844 transitions. Second operand has 55 states, 55 states have (on average 4.254545454545455) internal successors, (234), 54 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:38:52,966 INFO L93 Difference]: Finished difference Result 1306 states and 1372 transitions. [2021-11-23 02:38:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2021-11-23 02:38:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.254545454545455) internal successors, (234), 54 states have internal predecessors, (234), 0 states have call successors, (0), 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 1063 [2021-11-23 02:38:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:38:52,973 INFO L225 Difference]: With dead ends: 1306 [2021-11-23 02:38:52,973 INFO L226 Difference]: Without dead ends: 1306 [2021-11-23 02:38:52,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3394 GetRequests, 3156 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19697 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=16443, Invalid=40917, Unknown=0, NotChecked=0, Total=57360 [2021-11-23 02:38:52,979 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:38:52,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-23 02:38:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2021-11-23 02:38:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2021-11-23 02:38:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 1.0513409961685825) internal successors, (1372), 1305 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1372 transitions. [2021-11-23 02:38:53,004 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1372 transitions. Word has length 1063 [2021-11-23 02:38:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:38:53,005 INFO L470 AbstractCegarLoop]: Abstraction has 1306 states and 1372 transitions. [2021-11-23 02:38:53,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.254545454545455) internal successors, (234), 54 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:38:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1372 transitions. [2021-11-23 02:38:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2021-11-23 02:38:53,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:38:53,018 INFO L514 BasicCegarLoop]: trace histogram [372, 371, 371, 27, 26, 26, 1, 1] [2021-11-23 02:38:53,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-23 02:38:53,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-23 02:38:53,243 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:38:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:38:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash -177978296, now seen corresponding path program 16 times [2021-11-23 02:38:53,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:38:53,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495897543] [2021-11-23 02:38:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:38:53,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:38:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 217320 backedges. 110712 proven. 5729 refuted. 0 times theorem prover too weak. 100879 trivial. 0 not checked. [2021-11-23 02:38:54,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:38:54,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495897543] [2021-11-23 02:38:54,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495897543] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:38:54,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748038897] [2021-11-23 02:38:54,506 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:38:54,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:38:54,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:38:54,511 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:38:54,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-23 02:38:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:38:55,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 4507 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 02:38:55,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:38:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 217320 backedges. 111487 proven. 4954 refuted. 0 times theorem prover too weak. 100879 trivial. 0 not checked. [2021-11-23 02:38:56,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:38:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 217320 backedges. 111487 proven. 4954 refuted. 0 times theorem prover too weak. 100879 trivial. 0 not checked. [2021-11-23 02:38:58,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748038897] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:38:58,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968320062] [2021-11-23 02:38:58,696 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:38:58,696 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:38:58,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:38:58,697 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:38:58,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:38:58,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:58,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:38:58,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:58,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:38:58,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:58,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:59,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:38:59,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:59,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:59,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:59,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:59,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:38:59,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:59,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:38:59,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:59,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:38:59,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:38:59,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:38:59,448 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:38:59,858 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '66811#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:38:59,858 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:38:59,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:38:59,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 47 [2021-11-23 02:38:59,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322587046] [2021-11-23 02:38:59,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:38:59,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-23 02:38:59,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:38:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-23 02:38:59,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=2285, Unknown=0, NotChecked=0, Total=2862 [2021-11-23 02:38:59,862 INFO L87 Difference]: Start difference. First operand 1306 states and 1372 transitions. Second operand has 48 states, 48 states have (on average 3.8541666666666665) internal successors, (185), 47 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:39:02,349 INFO L93 Difference]: Finished difference Result 1306 states and 1368 transitions. [2021-11-23 02:39:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-11-23 02:39:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.8541666666666665) internal successors, (185), 47 states have internal predecessors, (185), 0 states have call successors, (0), 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 1195 [2021-11-23 02:39:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:39:02,356 INFO L225 Difference]: With dead ends: 1306 [2021-11-23 02:39:02,356 INFO L226 Difference]: Without dead ends: 1306 [2021-11-23 02:39:02,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3733 GetRequests, 3561 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9631 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=7761, Invalid=22341, Unknown=0, NotChecked=0, Total=30102 [2021-11-23 02:39:02,361 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:39:02,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 02:39:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2021-11-23 02:39:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2021-11-23 02:39:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 1.0482758620689656) internal successors, (1368), 1305 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1368 transitions. [2021-11-23 02:39:02,384 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1368 transitions. Word has length 1195 [2021-11-23 02:39:02,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:39:02,385 INFO L470 AbstractCegarLoop]: Abstraction has 1306 states and 1368 transitions. [2021-11-23 02:39:02,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.8541666666666665) internal successors, (185), 47 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1368 transitions. [2021-11-23 02:39:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2021-11-23 02:39:02,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:39:02,399 INFO L514 BasicCegarLoop]: trace histogram [376, 375, 375, 27, 26, 26, 1, 1] [2021-11-23 02:39:02,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-23 02:39:02,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-23 02:39:02,615 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:39:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:39:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1855894792, now seen corresponding path program 17 times [2021-11-23 02:39:02,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:39:02,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732213789] [2021-11-23 02:39:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:39:02,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:39:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:39:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 221902 backedges. 123099 proven. 6913 refuted. 0 times theorem prover too weak. 91890 trivial. 0 not checked. [2021-11-23 02:39:03,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:39:03,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732213789] [2021-11-23 02:39:03,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732213789] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:39:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779296338] [2021-11-23 02:39:03,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:39:03,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:39:03,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:39:03,911 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:39:03,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-23 02:39:04,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2021-11-23 02:39:04,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:39:04,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-23 02:39:04,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:39:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 221902 backedges. 24602 proven. 737 refuted. 0 times theorem prover too weak. 196563 trivial. 0 not checked. [2021-11-23 02:39:06,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:39:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 221902 backedges. 24602 proven. 737 refuted. 0 times theorem prover too weak. 196563 trivial. 0 not checked. [2021-11-23 02:39:07,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779296338] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:39:07,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [401381455] [2021-11-23 02:39:07,675 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:39:07,675 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:39:07,675 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:39:07,676 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:39:07,676 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:39:07,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:39:07,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:39:07,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:07,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:39:07,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:39:07,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:07,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:39:07,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:08,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:08,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:39:08,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:08,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:39:08,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:39:08,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:08,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:39:08,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:39:08,268 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:39:08,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:39:08,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:08,330 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:39:08,748 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '76973#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:39:08,749 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:39:08,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:39:08,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 25] total 68 [2021-11-23 02:39:08,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614497759] [2021-11-23 02:39:08,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:39:08,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2021-11-23 02:39:08,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:39:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-11-23 02:39:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=4508, Unknown=0, NotChecked=0, Total=5402 [2021-11-23 02:39:08,753 INFO L87 Difference]: Start difference. First operand 1306 states and 1368 transitions. Second operand has 68 states, 68 states have (on average 3.6323529411764706) internal successors, (247), 68 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:39:15,306 INFO L93 Difference]: Finished difference Result 1413 states and 1479 transitions. [2021-11-23 02:39:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2021-11-23 02:39:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.6323529411764706) internal successors, (247), 68 states have internal predecessors, (247), 0 states have call successors, (0), 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 1207 [2021-11-23 02:39:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:39:15,312 INFO L225 Difference]: With dead ends: 1413 [2021-11-23 02:39:15,312 INFO L226 Difference]: Without dead ends: 1413 [2021-11-23 02:39:15,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3848 GetRequests, 3579 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21539 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=14476, Invalid=58154, Unknown=0, NotChecked=0, Total=72630 [2021-11-23 02:39:15,317 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:39:15,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 2387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-23 02:39:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2021-11-23 02:39:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1319. [2021-11-23 02:39:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.0447647951441579) internal successors, (1377), 1318 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1377 transitions. [2021-11-23 02:39:15,338 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1377 transitions. Word has length 1207 [2021-11-23 02:39:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:39:15,339 INFO L470 AbstractCegarLoop]: Abstraction has 1319 states and 1377 transitions. [2021-11-23 02:39:15,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.6323529411764706) internal successors, (247), 68 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1377 transitions. [2021-11-23 02:39:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2021-11-23 02:39:15,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:39:15,354 INFO L514 BasicCegarLoop]: trace histogram [389, 388, 388, 27, 26, 26, 1, 1] [2021-11-23 02:39:15,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-23 02:39:15,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-23 02:39:15,567 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:39:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:39:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1052356104, now seen corresponding path program 18 times [2021-11-23 02:39:15,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:39:15,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319113524] [2021-11-23 02:39:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:39:15,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:39:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:39:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 237125 backedges. 139795 proven. 8248 refuted. 0 times theorem prover too weak. 89082 trivial. 0 not checked. [2021-11-23 02:39:17,165 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:39:17,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319113524] [2021-11-23 02:39:17,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319113524] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:39:17,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314932001] [2021-11-23 02:39:17,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:39:17,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:39:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:39:17,166 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:39:17,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-23 02:39:27,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:39:27,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:39:27,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 4677 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-23 02:39:27,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:39:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 237125 backedges. 37870 proven. 189792 refuted. 0 times theorem prover too weak. 9463 trivial. 0 not checked. [2021-11-23 02:39:31,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:39:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 237125 backedges. 37870 proven. 189792 refuted. 0 times theorem prover too weak. 9463 trivial. 0 not checked. [2021-11-23 02:39:34,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314932001] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:39:34,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1388844384] [2021-11-23 02:39:34,349 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:39:34,349 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:39:34,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:39:34,350 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:39:34,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:39:34,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:39:34,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:39:34,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:39:34,511 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:39:34,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:39:34,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:39:34,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:39:34,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:39:34,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:39:34,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:39:34,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:39:34,971 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:39:35,611 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '87691#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:39:35,612 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:39:35,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:39:35,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 55, 55] total 116 [2021-11-23 02:39:35,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476397151] [2021-11-23 02:39:35,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:39:35,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2021-11-23 02:39:35,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:39:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2021-11-23 02:39:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2039, Invalid=12967, Unknown=0, NotChecked=0, Total=15006 [2021-11-23 02:39:35,617 INFO L87 Difference]: Start difference. First operand 1319 states and 1377 transitions. Second operand has 117 states, 117 states have (on average 3.9743589743589745) internal successors, (465), 116 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:39:55,880 INFO L93 Difference]: Finished difference Result 1560 states and 1631 transitions. [2021-11-23 02:39:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 543 states. [2021-11-23 02:39:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 3.9743589743589745) internal successors, (465), 116 states have internal predecessors, (465), 0 states have call successors, (0), 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 1246 [2021-11-23 02:39:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:39:55,885 INFO L225 Difference]: With dead ends: 1560 [2021-11-23 02:39:55,885 INFO L226 Difference]: Without dead ends: 1560 [2021-11-23 02:39:55,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4309 GetRequests, 3648 SyntacticMatches, 1 SemanticMatches, 660 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163783 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=41362, Invalid=396220, Unknown=0, NotChecked=0, Total=437582 [2021-11-23 02:39:55,903 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2067 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8344 mSolverCounterSat, 1734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1734 IncrementalHoareTripleChecker+Valid, 8344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:39:55,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2067 Valid, 0 Invalid, 10078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1734 Valid, 8344 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-11-23 02:39:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-11-23 02:39:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1484. [2021-11-23 02:39:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.0485502360080916) internal successors, (1555), 1483 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1555 transitions. [2021-11-23 02:39:55,924 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1555 transitions. Word has length 1246 [2021-11-23 02:39:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:39:55,925 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 1555 transitions. [2021-11-23 02:39:55,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 3.9743589743589745) internal successors, (465), 116 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:39:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1555 transitions. [2021-11-23 02:39:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1373 [2021-11-23 02:39:55,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:39:55,942 INFO L514 BasicCegarLoop]: trace histogram [429, 428, 428, 29, 28, 28, 1, 1] [2021-11-23 02:39:55,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-23 02:39:56,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-23 02:39:56,159 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:39:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:39:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1729657912, now seen corresponding path program 19 times [2021-11-23 02:39:56,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:39:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462786943] [2021-11-23 02:39:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:39:56,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:39:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:39:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 288164 backedges. 172023 proven. 9743 refuted. 0 times theorem prover too weak. 106398 trivial. 0 not checked. [2021-11-23 02:39:58,265 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:39:58,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462786943] [2021-11-23 02:39:58,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462786943] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:39:58,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989320375] [2021-11-23 02:39:58,265 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:39:58,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:39:58,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:39:58,266 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:39:58,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-23 02:39:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:39:58,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 5135 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-23 02:39:58,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:40:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 288164 backedges. 173149 proven. 8617 refuted. 0 times theorem prover too weak. 106398 trivial. 0 not checked. [2021-11-23 02:40:01,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:40:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 288164 backedges. 173149 proven. 8617 refuted. 0 times theorem prover too weak. 106398 trivial. 0 not checked. [2021-11-23 02:40:03,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989320375] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:40:03,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [35745505] [2021-11-23 02:40:03,059 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:40:03,059 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:40:03,059 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:40:03,060 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:40:03,060 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:40:03,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:40:03,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:40:03,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:40:03,226 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:40:03,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:40:03,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:03,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:40:03,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:03,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:03,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:40:03,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:40:03,556 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:40:03,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:40:03,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:03,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:40:03,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:03,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:40:03,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:40:03,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:03,778 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:40:04,127 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '100102#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:40:04,127 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:40:04,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:40:04,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 56 [2021-11-23 02:40:04,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883515727] [2021-11-23 02:40:04,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:40:04,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-11-23 02:40:04,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:40:04,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-11-23 02:40:04,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=3113, Unknown=0, NotChecked=0, Total=3906 [2021-11-23 02:40:04,131 INFO L87 Difference]: Start difference. First operand 1484 states and 1555 transitions. Second operand has 57 states, 57 states have (on average 3.8771929824561404) internal successors, (221), 56 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:40:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:40:08,133 INFO L93 Difference]: Finished difference Result 1484 states and 1554 transitions. [2021-11-23 02:40:08,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-11-23 02:40:08,134 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.8771929824561404) internal successors, (221), 56 states have internal predecessors, (221), 0 states have call successors, (0), 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 1372 [2021-11-23 02:40:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:40:08,139 INFO L225 Difference]: With dead ends: 1484 [2021-11-23 02:40:08,139 INFO L226 Difference]: Without dead ends: 1484 [2021-11-23 02:40:08,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4321 GetRequests, 4089 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18203 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=14606, Invalid=39916, Unknown=0, NotChecked=0, Total=54522 [2021-11-23 02:40:08,142 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:40:08,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 02:40:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-11-23 02:40:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2021-11-23 02:40:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.047875927174646) internal successors, (1554), 1483 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:40:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1554 transitions. [2021-11-23 02:40:08,163 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1554 transitions. Word has length 1372 [2021-11-23 02:40:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:40:08,164 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 1554 transitions. [2021-11-23 02:40:08,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.8771929824561404) internal successors, (221), 56 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:40:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1554 transitions. [2021-11-23 02:40:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1376 [2021-11-23 02:40:08,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:40:08,181 INFO L514 BasicCegarLoop]: trace histogram [430, 429, 429, 29, 28, 28, 1, 1] [2021-11-23 02:40:08,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-23 02:40:08,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:40:08,407 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:40:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:40:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -720956896, now seen corresponding path program 20 times [2021-11-23 02:40:08,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:40:08,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60703480] [2021-11-23 02:40:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:40:08,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:40:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:40:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 289478 backedges. 197124 proven. 13249 refuted. 0 times theorem prover too weak. 79105 trivial. 0 not checked. [2021-11-23 02:40:10,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:40:10,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60703480] [2021-11-23 02:40:10,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60703480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:40:10,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480173974] [2021-11-23 02:40:10,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:40:10,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:40:10,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:40:10,126 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:40:10,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-23 02:40:11,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2021-11-23 02:40:11,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:40:11,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-23 02:40:11,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:40:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 289478 backedges. 69319 proven. 3971 refuted. 0 times theorem prover too weak. 216188 trivial. 0 not checked. [2021-11-23 02:40:13,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:40:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 289478 backedges. 69256 proven. 4034 refuted. 0 times theorem prover too weak. 216188 trivial. 0 not checked. [2021-11-23 02:40:17,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480173974] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:40:17,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610721579] [2021-11-23 02:40:17,201 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:40:17,201 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:40:17,201 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:40:17,201 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:40:17,202 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:40:17,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:40:17,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:40:17,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:40:17,366 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:40:17,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:40:17,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:17,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:40:17,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:40:17,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:17,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:40:17,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:40:17,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:40:17,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:17,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:40:17,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:40:17,874 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:40:17,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:40:17,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:40:17,931 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:40:18,465 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '111773#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:40:18,465 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:40:18,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:40:18,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 36] total 111 [2021-11-23 02:40:18,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772284463] [2021-11-23 02:40:18,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:40:18,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2021-11-23 02:40:18,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:40:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2021-11-23 02:40:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2274, Invalid=11298, Unknown=0, NotChecked=0, Total=13572 [2021-11-23 02:40:18,471 INFO L87 Difference]: Start difference. First operand 1484 states and 1554 transitions. Second operand has 111 states, 111 states have (on average 3.3513513513513513) internal successors, (372), 111 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:40:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:40:41,525 INFO L93 Difference]: Finished difference Result 1921 states and 2032 transitions. [2021-11-23 02:40:41,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 432 states. [2021-11-23 02:40:41,526 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 3.3513513513513513) internal successors, (372), 111 states have internal predecessors, (372), 0 states have call successors, (0), 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 1375 [2021-11-23 02:40:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:40:41,534 INFO L225 Difference]: With dead ends: 1921 [2021-11-23 02:40:41,534 INFO L226 Difference]: Without dead ends: 1921 [2021-11-23 02:40:41,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4592 GetRequests, 4049 SyntacticMatches, 0 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98489 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=54063, Invalid=242417, Unknown=0, NotChecked=0, Total=296480 [2021-11-23 02:40:41,561 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2234 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 1392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1392 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:40:41,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2234 Valid, 0 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1392 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-23 02:40:41,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2021-11-23 02:40:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1589. [2021-11-23 02:40:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.0472292191435768) internal successors, (1663), 1588 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:40:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1663 transitions. [2021-11-23 02:40:41,672 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1663 transitions. Word has length 1375 [2021-11-23 02:40:41,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:40:41,673 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 1663 transitions. [2021-11-23 02:40:41,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.3513513513513513) internal successors, (372), 111 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:40:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1663 transitions. [2021-11-23 02:40:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1505 [2021-11-23 02:40:41,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:40:41,693 INFO L514 BasicCegarLoop]: trace histogram [472, 471, 471, 30, 29, 29, 1, 1] [2021-11-23 02:40:41,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-23 02:40:41,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-23 02:40:41,907 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:40:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:40:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1003450308, now seen corresponding path program 21 times [2021-11-23 02:40:41,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:40:41,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558525644] [2021-11-23 02:40:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:40:41,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:40:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:40:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 347932 backedges. 238175 proven. 15278 refuted. 0 times theorem prover too weak. 94479 trivial. 0 not checked. [2021-11-23 02:40:43,756 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:40:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558525644] [2021-11-23 02:40:43,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558525644] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:40:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80169452] [2021-11-23 02:40:43,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:40:43,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:40:43,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:40:43,757 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:40:43,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-23 02:41:32,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:41:32,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:41:32,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 5594 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-23 02:41:32,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:41:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 347932 backedges. 296238 proven. 21184 refuted. 0 times theorem prover too weak. 30510 trivial. 0 not checked. [2021-11-23 02:41:35,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:41:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 347932 backedges. 296238 proven. 21184 refuted. 0 times theorem prover too weak. 30510 trivial. 0 not checked. [2021-11-23 02:41:38,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80169452] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:41:38,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2045082175] [2021-11-23 02:41:38,300 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:41:38,300 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:41:38,300 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:41:38,300 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:41:38,300 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:41:38,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:41:38,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:41:38,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:41:38,429 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:41:38,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:41:38,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:38,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:41:38,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:41:38,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:38,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:41:38,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:41:38,727 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:41:38,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:41:38,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:38,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:41:38,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:38,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:41:38,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:41:38,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:38,908 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:41:39,305 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '125242#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:41:39,305 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:41:39,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:41:39,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 48, 48] total 77 [2021-11-23 02:41:39,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239908502] [2021-11-23 02:41:39,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:41:39,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-11-23 02:41:39,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:41:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-23 02:41:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1501, Invalid=5471, Unknown=0, NotChecked=0, Total=6972 [2021-11-23 02:41:39,310 INFO L87 Difference]: Start difference. First operand 1589 states and 1663 transitions. Second operand has 78 states, 78 states have (on average 4.230769230769231) internal successors, (330), 77 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:41:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:41:49,127 INFO L93 Difference]: Finished difference Result 1589 states and 1622 transitions. [2021-11-23 02:41:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 390 states. [2021-11-23 02:41:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 4.230769230769231) internal successors, (330), 77 states have internal predecessors, (330), 0 states have call successors, (0), 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 1504 [2021-11-23 02:41:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:41:49,133 INFO L225 Difference]: With dead ends: 1589 [2021-11-23 02:41:49,133 INFO L226 Difference]: Without dead ends: 1589 [2021-11-23 02:41:49,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4914 GetRequests, 4470 SyntacticMatches, 0 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73867 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=59021, Invalid=139449, Unknown=0, NotChecked=0, Total=198470 [2021-11-23 02:41:49,141 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:41:49,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-23 02:41:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-11-23 02:41:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-11-23 02:41:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.021410579345088) internal successors, (1622), 1588 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:41:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1622 transitions. [2021-11-23 02:41:49,156 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1622 transitions. Word has length 1504 [2021-11-23 02:41:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:41:49,157 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 1622 transitions. [2021-11-23 02:41:49,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 4.230769230769231) internal successors, (330), 77 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:41:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1622 transitions. [2021-11-23 02:41:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1544 [2021-11-23 02:41:49,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:41:49,177 INFO L514 BasicCegarLoop]: trace histogram [485, 484, 484, 30, 29, 29, 1, 1] [2021-11-23 02:41:49,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-23 02:41:49,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-23 02:41:49,403 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:41:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:41:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1835447924, now seen corresponding path program 22 times [2021-11-23 02:41:49,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:41:49,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37200768] [2021-11-23 02:41:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:41:49,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:41:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:41:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 366938 backedges. 261063 proven. 17503 refuted. 0 times theorem prover too weak. 88372 trivial. 0 not checked. [2021-11-23 02:41:51,423 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:41:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37200768] [2021-11-23 02:41:51,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37200768] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:41:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085947626] [2021-11-23 02:41:51,423 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:41:51,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:41:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:41:51,424 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:41:51,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-23 02:41:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:41:52,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 5724 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-23 02:41:52,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:41:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 366938 backedges. 262755 proven. 15811 refuted. 0 times theorem prover too weak. 88372 trivial. 0 not checked. [2021-11-23 02:41:54,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:41:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 366938 backedges. 262755 proven. 15811 refuted. 0 times theorem prover too weak. 88372 trivial. 0 not checked. [2021-11-23 02:41:57,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085947626] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:41:57,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924152153] [2021-11-23 02:41:57,111 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:41:57,111 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:41:57,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:41:57,111 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:41:57,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:41:57,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:41:57,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:41:57,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:41:57,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:41:57,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:41:57,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:41:57,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:41:57,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:41:57,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:41:57,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:41:57,704 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:41:58,335 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '138471#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (<= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |ULTIMATE.start_main_~#b~0#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.offset|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:41:58,335 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:41:58,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:41:58,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 68 [2021-11-23 02:41:58,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732083246] [2021-11-23 02:41:58,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:41:58,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2021-11-23 02:41:58,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:41:58,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-11-23 02:41:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1137, Invalid=4413, Unknown=0, NotChecked=0, Total=5550 [2021-11-23 02:41:58,340 INFO L87 Difference]: Start difference. First operand 1589 states and 1622 transitions. Second operand has 69 states, 69 states have (on average 3.898550724637681) internal successors, (269), 68 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:42:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:05,131 INFO L93 Difference]: Finished difference Result 1589 states and 1617 transitions. [2021-11-23 02:42:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2021-11-23 02:42:05,131 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 3.898550724637681) internal successors, (269), 68 states have internal predecessors, (269), 0 states have call successors, (0), 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 1543 [2021-11-23 02:42:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:05,137 INFO L225 Difference]: With dead ends: 1589 [2021-11-23 02:42:05,137 INFO L226 Difference]: Without dead ends: 1589 [2021-11-23 02:42:05,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4924 GetRequests, 4598 SyntacticMatches, 0 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37568 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=29818, Invalid=77438, Unknown=0, NotChecked=0, Total=107256 [2021-11-23 02:42:05,145 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:05,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-23 02:42:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-11-23 02:42:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-11-23 02:42:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 1.0182619647355164) internal successors, (1617), 1588 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:42:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 1617 transitions. [2021-11-23 02:42:05,159 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 1617 transitions. Word has length 1543 [2021-11-23 02:42:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:05,160 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 1617 transitions. [2021-11-23 02:42:05,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 3.898550724637681) internal successors, (269), 68 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:42:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 1617 transitions. [2021-11-23 02:42:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1559 [2021-11-23 02:42:05,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:05,180 INFO L514 BasicCegarLoop]: trace histogram [490, 489, 489, 30, 29, 29, 1, 1] [2021-11-23 02:42:05,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:05,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:05,395 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:42:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash 218154556, now seen corresponding path program 23 times [2021-11-23 02:42:05,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:05,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36685699] [2021-11-23 02:42:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:05,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 374383 backedges. 277851 proven. 19933 refuted. 0 times theorem prover too weak. 76599 trivial. 0 not checked. [2021-11-23 02:42:07,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:07,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36685699] [2021-11-23 02:42:07,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36685699] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:07,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435514014] [2021-11-23 02:42:07,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:42:07,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:07,316 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:07,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-23 02:42:10,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2021-11-23 02:42:10,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:42:10,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 1923 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-23 02:42:10,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:42:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 374383 backedges. 114833 proven. 10171 refuted. 0 times theorem prover too weak. 249379 trivial. 0 not checked. [2021-11-23 02:42:13,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:42:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 374383 backedges. 114770 proven. 10234 refuted. 0 times theorem prover too weak. 249379 trivial. 0 not checked. [2021-11-23 02:42:17,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435514014] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:42:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906106226] [2021-11-23 02:42:17,307 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:42:17,307 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:42:17,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:42:17,307 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:42:17,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:42:17,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:42:17,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:42:17,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:42:17,430 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:42:17,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:42:17,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:42:17,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:42:17,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:42:17,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:42:17,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:42:17,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:42:17,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:42:17,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:42:17,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:42:17,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:42:17,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:42:17,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:42:17,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:42:17,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:42:17,875 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:42:18,418 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '151622#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:42:18,418 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:42:18,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:42:18,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 38, 38] total 119 [2021-11-23 02:42:18,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389701915] [2021-11-23 02:42:18,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:42:18,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2021-11-23 02:42:18,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:42:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2021-11-23 02:42:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2486, Invalid=13014, Unknown=0, NotChecked=0, Total=15500 [2021-11-23 02:42:18,423 INFO L87 Difference]: Start difference. First operand 1589 states and 1617 transitions. Second operand has 119 states, 119 states have (on average 3.495798319327731) internal successors, (416), 119 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:42:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:42:44,874 INFO L93 Difference]: Finished difference Result 2209 states and 2272 transitions. [2021-11-23 02:42:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 493 states. [2021-11-23 02:42:44,875 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 3.495798319327731) internal successors, (416), 119 states have internal predecessors, (416), 0 states have call successors, (0), 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 1558 [2021-11-23 02:42:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:42:44,882 INFO L225 Difference]: With dead ends: 2209 [2021-11-23 02:42:44,882 INFO L226 Difference]: Without dead ends: 2209 [2021-11-23 02:42:44,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5208 GetRequests, 4596 SyntacticMatches, 0 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126394 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=67236, Invalid=309146, Unknown=0, NotChecked=0, Total=376382 [2021-11-23 02:42:44,902 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1855 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:42:44,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 0 Invalid, 4526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 3428 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-23 02:42:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2021-11-23 02:42:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1598. [2021-11-23 02:42:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.0175328741390106) internal successors, (1625), 1597 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:42:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1625 transitions. [2021-11-23 02:42:44,920 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1625 transitions. Word has length 1558 [2021-11-23 02:42:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:42:44,921 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 1625 transitions. [2021-11-23 02:42:44,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 3.495798319327731) internal successors, (416), 119 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:42:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1625 transitions. [2021-11-23 02:42:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1580 [2021-11-23 02:42:44,936 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:42:44,937 INFO L514 BasicCegarLoop]: trace histogram [497, 496, 496, 30, 29, 29, 1, 1] [2021-11-23 02:42:44,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-23 02:42:45,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-11-23 02:42:45,137 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:42:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:42:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1173860988, now seen corresponding path program 24 times [2021-11-23 02:42:45,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:42:45,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113520483] [2021-11-23 02:42:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:42:45,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:42:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:42:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 384932 backedges. 295852 proven. 22577 refuted. 0 times theorem prover too weak. 66503 trivial. 0 not checked. [2021-11-23 02:42:47,097 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:42:47,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113520483] [2021-11-23 02:42:47,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113520483] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:42:47,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382155090] [2021-11-23 02:42:47,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:42:47,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:42:47,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:42:47,098 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:42:47,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-23 02:43:16,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:43:16,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:43:16,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 5844 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-23 02:43:16,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:43:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 384932 backedges. 317823 proven. 23828 refuted. 0 times theorem prover too weak. 43281 trivial. 0 not checked. [2021-11-23 02:43:19,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:43:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 384932 backedges. 317823 proven. 23828 refuted. 0 times theorem prover too weak. 43281 trivial. 0 not checked. [2021-11-23 02:43:22,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382155090] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:43:22,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [400562888] [2021-11-23 02:43:22,108 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:43:22,108 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:43:22,108 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:43:22,108 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:43:22,108 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:43:22,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:43:22,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:43:22,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:43:22,231 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:43:22,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 231 treesize of output 237 [2021-11-23 02:43:22,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:22,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:43:22,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:43:22,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:22,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:43:22,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:22,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:43:22,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:43:22,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:22,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:43:22,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:43:22,657 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:43:22,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:43:22,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:22,719 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:43:23,154 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '165961#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:43:23,155 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:43:23,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:43:23,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 50, 50] total 78 [2021-11-23 02:43:23,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975475078] [2021-11-23 02:43:23,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:43:23,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2021-11-23 02:43:23,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:43:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-11-23 02:43:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1474, Invalid=5666, Unknown=0, NotChecked=0, Total=7140 [2021-11-23 02:43:23,159 INFO L87 Difference]: Start difference. First operand 1598 states and 1625 transitions. Second operand has 79 states, 79 states have (on average 4.025316455696203) internal successors, (318), 78 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:43:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:43:33,176 INFO L93 Difference]: Finished difference Result 1598 states and 1620 transitions. [2021-11-23 02:43:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 376 states. [2021-11-23 02:43:33,177 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 4.025316455696203) internal successors, (318), 78 states have internal predecessors, (318), 0 states have call successors, (0), 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 1579 [2021-11-23 02:43:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:43:33,183 INFO L225 Difference]: With dead ends: 1598 [2021-11-23 02:43:33,183 INFO L226 Difference]: Without dead ends: 1598 [2021-11-23 02:43:33,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5132 GetRequests, 4700 SyntacticMatches, 0 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68958 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=54774, Invalid=133148, Unknown=0, NotChecked=0, Total=187922 [2021-11-23 02:43:33,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:43:33,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-23 02:43:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-11-23 02:43:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2021-11-23 02:43:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.0144020037570445) internal successors, (1620), 1597 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:43:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1620 transitions. [2021-11-23 02:43:33,217 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1620 transitions. Word has length 1579 [2021-11-23 02:43:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:43:33,218 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 1620 transitions. [2021-11-23 02:43:33,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 4.025316455696203) internal successors, (318), 78 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:43:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1620 transitions. [2021-11-23 02:43:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1595 [2021-11-23 02:43:33,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:43:33,239 INFO L514 BasicCegarLoop]: trace histogram [502, 501, 501, 30, 29, 29, 1, 1] [2021-11-23 02:43:33,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2021-11-23 02:43:33,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-11-23 02:43:33,456 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:43:33,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:43:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1320349548, now seen corresponding path program 25 times [2021-11-23 02:43:33,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:43:33,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992985774] [2021-11-23 02:43:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:43:33,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:43:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 392557 backedges. 311364 proven. 25444 refuted. 0 times theorem prover too weak. 55749 trivial. 0 not checked. [2021-11-23 02:43:35,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:43:35,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992985774] [2021-11-23 02:43:35,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992985774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:43:35,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565660873] [2021-11-23 02:43:35,491 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:43:35,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:43:35,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:43:35,492 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:43:35,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-11-23 02:43:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:36,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 5894 conjuncts, 52 conjunts are in the unsatisfiable core [2021-11-23 02:43:36,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:43:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 392557 backedges. 313554 proven. 23254 refuted. 0 times theorem prover too weak. 55749 trivial. 0 not checked. [2021-11-23 02:43:39,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:43:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 392557 backedges. 313554 proven. 23254 refuted. 0 times theorem prover too weak. 55749 trivial. 0 not checked. [2021-11-23 02:43:41,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565660873] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:43:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409366434] [2021-11-23 02:43:41,769 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:43:41,769 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:43:41,769 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:43:41,769 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:43:41,770 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:43:41,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:43:41,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:43:41,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:41,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:43:41,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:43:41,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:41,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:43:42,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:43:42,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:42,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:43:42,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:43:42,157 INFO L354 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2021-11-23 02:43:42,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 117 treesize of output 123 [2021-11-23 02:43:42,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:42,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:43:42,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:42,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:43:42,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 120 treesize of output 122 [2021-11-23 02:43:42,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:43:42,343 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:43:42,748 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '179497#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:43:42,748 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:43:42,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:43:42,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 77 [2021-11-23 02:43:42,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321569458] [2021-11-23 02:43:42,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:43:42,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2021-11-23 02:43:42,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:43:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-23 02:43:42,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=5535, Unknown=0, NotChecked=0, Total=6972 [2021-11-23 02:43:42,753 INFO L87 Difference]: Start difference. First operand 1598 states and 1620 transitions. Second operand has 78 states, 78 states have (on average 3.91025641025641) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:43:52,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:43:52,398 INFO L93 Difference]: Finished difference Result 1598 states and 1619 transitions. [2021-11-23 02:43:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 351 states. [2021-11-23 02:43:52,398 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 3.91025641025641) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 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 1594 [2021-11-23 02:43:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:43:52,405 INFO L225 Difference]: With dead ends: 1598 [2021-11-23 02:43:52,405 INFO L226 Difference]: Without dead ends: 1598 [2021-11-23 02:43:52,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5155 GetRequests, 4748 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60231 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=47366, Invalid=119506, Unknown=0, NotChecked=0, Total=166872 [2021-11-23 02:43:52,412 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:43:52,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-23 02:43:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2021-11-23 02:43:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2021-11-23 02:43:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1597 states have (on average 1.0137758296806512) internal successors, (1619), 1597 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:43:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1619 transitions. [2021-11-23 02:43:52,425 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1619 transitions. Word has length 1594 [2021-11-23 02:43:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:43:52,426 INFO L470 AbstractCegarLoop]: Abstraction has 1598 states and 1619 transitions. [2021-11-23 02:43:52,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.91025641025641) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:43:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1619 transitions. [2021-11-23 02:43:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1598 [2021-11-23 02:43:52,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:43:52,441 INFO L514 BasicCegarLoop]: trace histogram [503, 502, 502, 30, 29, 29, 1, 1] [2021-11-23 02:43:52,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-11-23 02:43:52,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:43:52,642 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:43:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:43:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 41941204, now seen corresponding path program 26 times [2021-11-23 02:43:52,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:43:52,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594713141] [2021-11-23 02:43:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:43:52,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:43:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:43:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 394091 backedges. 122491 proven. 247320 refuted. 0 times theorem prover too weak. 24280 trivial. 0 not checked. [2021-11-23 02:43:54,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:43:54,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594713141] [2021-11-23 02:43:54,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594713141] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:43:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203599543] [2021-11-23 02:43:54,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:43:54,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:43:54,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:43:54,758 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:43:54,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-11-23 02:44:02,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2021-11-23 02:44:02,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:44:02,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-23 02:44:02,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:44:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 394091 backedges. 165892 proven. 29561 refuted. 0 times theorem prover too weak. 198638 trivial. 0 not checked. [2021-11-23 02:44:05,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:44:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 394091 backedges. 165829 proven. 29624 refuted. 0 times theorem prover too weak. 198638 trivial. 0 not checked. [2021-11-23 02:44:09,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203599543] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:44:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980264392] [2021-11-23 02:44:09,472 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-11-23 02:44:09,472 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:44:09,473 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:44:09,473 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:44:09,473 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:44:09,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:44:09,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-11-23 02:44:09,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:09,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:44:09,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 236 [2021-11-23 02:44:09,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:09,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:44:09,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:44:09,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:09,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:09,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:44:09,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:44:10,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:10,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:10,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-23 02:44:10,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-11-23 02:44:10,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:10,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2021-11-23 02:44:10,167 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:44:10,802 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '193052#(and (<= |ULTIMATE.start_foo_#in~b#1.offset| 0) (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 0 |ULTIMATE.start_foo_~b#1.offset|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 32 |ULTIMATE.start_foo_~i~0#1|) (<= 0 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~b#1.base|) (<= 0 |ULTIMATE.start_foo_#in~b#1.offset|) (<= 0 |ULTIMATE.start_main_~#mask~0#1.base|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_main_~#b~0#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_foo_~b#1.offset| 0) (= |#NULL.base| 0))' at error location [2021-11-23 02:44:10,802 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:44:10,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:44:10,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 38, 38] total 127 [2021-11-23 02:44:10,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987836756] [2021-11-23 02:44:10,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:44:10,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2021-11-23 02:44:10,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:44:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2021-11-23 02:44:10,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3144, Invalid=14412, Unknown=0, NotChecked=0, Total=17556 [2021-11-23 02:44:10,808 INFO L87 Difference]: Start difference. First operand 1598 states and 1619 transitions. Second operand has 127 states, 127 states have (on average 3.661417322834646) internal successors, (465), 127 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:45:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:45:13,775 INFO L93 Difference]: Finished difference Result 2653 states and 2724 transitions. [2021-11-23 02:45:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 626 states. [2021-11-23 02:45:13,775 INFO L78 Accepts]: Start accepts. Automaton has has 127 states, 127 states have (on average 3.661417322834646) internal successors, (465), 127 states have internal predecessors, (465), 0 states have call successors, (0), 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 1597 [2021-11-23 02:45:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:45:13,784 INFO L225 Difference]: With dead ends: 2653 [2021-11-23 02:45:13,785 INFO L226 Difference]: Without dead ends: 2653 [2021-11-23 02:45:13,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5467 GetRequests, 4714 SyntacticMatches, 2 SemanticMatches, 751 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211431 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=131746, Invalid=434510, Unknown=0, NotChecked=0, Total=566256 [2021-11-23 02:45:13,808 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7237 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 3788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3788 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:45:13,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7237 Valid, 0 Invalid, 5604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3788 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-23 02:45:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2021-11-23 02:45:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1775. [2021-11-23 02:45:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 1.0146561443066517) internal successors, (1800), 1774 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:45:13,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1800 transitions. [2021-11-23 02:45:13,829 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1800 transitions. Word has length 1597 [2021-11-23 02:45:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:45:13,830 INFO L470 AbstractCegarLoop]: Abstraction has 1775 states and 1800 transitions. [2021-11-23 02:45:13,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 3.661417322834646) internal successors, (465), 127 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:45:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1800 transitions. [2021-11-23 02:45:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1775 [2021-11-23 02:45:13,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:45:13,849 INFO L514 BasicCegarLoop]: trace histogram [560, 559, 559, 32, 31, 31, 1, 1] [2021-11-23 02:45:13,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-11-23 02:45:14,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-11-23 02:45:14,049 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION (and 5 more)] === [2021-11-23 02:45:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:45:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1592224788, now seen corresponding path program 27 times [2021-11-23 02:45:14,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:45:14,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800906743] [2021-11-23 02:45:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:45:14,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:45:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:45:17,896 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 02:45:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 02:45:22,710 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-23 02:45:22,711 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 02:45:22,712 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (7 of 8 remaining) [2021-11-23 02:45:22,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (6 of 8 remaining) [2021-11-23 02:45:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (5 of 8 remaining) [2021-11-23 02:45:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (4 of 8 remaining) [2021-11-23 02:45:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (3 of 8 remaining) [2021-11-23 02:45:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (2 of 8 remaining) [2021-11-23 02:45:22,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (1 of 8 remaining) [2021-11-23 02:45:22,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2021-11-23 02:45:22,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-23 02:45:22,718 INFO L732 BasicCegarLoop]: Path program histogram: [27, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:45:22,725 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:45:23,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:45:23 BoogieIcfgContainer [2021-11-23 02:45:23,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:45:23,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:45:23,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:45:23,361 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:45:23,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:27" (3/4) ... [2021-11-23 02:45:23,364 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-23 02:45:23,912 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 02:45:23,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:45:23,913 INFO L158 Benchmark]: Toolchain (without parser) took 536729.96ms. Allocated memory was 98.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 61.7MB in the beginning and 753.0MB in the end (delta: -691.3MB). Peak memory consumption was 812.8MB. Max. memory is 16.1GB. [2021-11-23 02:45:23,913 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:45:23,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.43ms. Allocated memory is still 98.6MB. Free memory was 61.4MB in the beginning and 75.4MB in the end (delta: -14.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 02:45:23,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.92ms. Allocated memory is still 98.6MB. Free memory was 75.4MB in the beginning and 73.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:45:23,921 INFO L158 Benchmark]: Boogie Preprocessor took 22.56ms. Allocated memory is still 98.6MB. Free memory was 73.9MB in the beginning and 72.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:45:23,921 INFO L158 Benchmark]: RCFGBuilder took 420.92ms. Allocated memory is still 98.6MB. Free memory was 72.8MB in the beginning and 60.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-23 02:45:23,921 INFO L158 Benchmark]: TraceAbstraction took 535444.52ms. Allocated memory was 98.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 60.3MB in the beginning and 864.3MB in the end (delta: -804.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-23 02:45:23,921 INFO L158 Benchmark]: Witness Printer took 551.60ms. Allocated memory is still 1.6GB. Free memory was 864.3MB in the beginning and 753.0MB in the end (delta: 111.3MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2021-11-23 02:45:23,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.43ms. Allocated memory is still 98.6MB. Free memory was 61.4MB in the beginning and 75.4MB in the end (delta: -14.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.92ms. Allocated memory is still 98.6MB. Free memory was 75.4MB in the beginning and 73.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.56ms. Allocated memory is still 98.6MB. Free memory was 73.9MB in the beginning and 72.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.92ms. Allocated memory is still 98.6MB. Free memory was 72.8MB in the beginning and 60.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 535444.52ms. Allocated memory was 98.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 60.3MB in the beginning and 864.3MB in the end (delta: -804.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 551.60ms. Allocated memory is still 1.6GB. Free memory was 864.3MB in the beginning and 753.0MB in the end (delta: 111.3MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 VAL [b={34:0}, i=0, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=1, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=2, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=3, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=4, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=5, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=6, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=7, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=8, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=9, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=10, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=11, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=12, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=13, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=14, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=15, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=16, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=17, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=18, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=19, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=20, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=21, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=22, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=23, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=24, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=25, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=26, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=27, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=28, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=29, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=30, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=31, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L18] a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 534.7s, OverallIterations: 46, TraceHistogramMax: 560, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.3s, AutomataDifference: 241.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20276 SdHoareTripleChecker+Valid, 27.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20276 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 23.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 88 IncrementalHoareTripleChecker+Unchecked, 1116 mSDsCounter, 12873 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44177 IncrementalHoareTripleChecker+Invalid, 57138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12873 mSolverCounterUnsat, 126 mSDtfsCounter, 44177 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70254 GetRequests, 62833 SyntacticMatches, 16 SemanticMatches, 7405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137993 ImplicationChecksByTransitivity, 249.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1775occurred in iteration=45, InterpolantAutomatonStates: 5918, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 45 MinimizatonAttempts, 6027 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.7s SsaConstructionTime, 129.3s SatisfiabilityAnalysisTime, 105.2s InterpolantComputationTime, 44578 NumberOfCodeBlocks, 39361 NumberOfCodeBlocksAsserted, 291 NumberOfCheckSat, 63964 ConstructedInterpolants, 75 QuantifiedInterpolants, 144938 SizeOfPredicates, 145 NumberOfNonLiveVariables, 62106 ConjunctsInSsa, 905 ConjunctsInUnsatCore, 118 InterpolantComputations, 10 PerfectInterpolantSequences, 10899519/12085393 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 0.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 4, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.5s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 14, TOOLS_QUANTIFIERELIM_TIME: 0.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 28, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 4, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 34, DAG_COMPRESSION_RETAINED_NODES: 20, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-23 02:45:24,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed0a5c9d-aec9-48d1-8474-7bdeb30e23bd/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)