./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:59:29,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:59:29,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:59:29,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:59:29,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:59:29,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:59:29,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:59:29,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:59:29,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:59:29,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:59:29,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:59:29,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:59:29,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:59:29,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:59:29,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:59:29,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:59:29,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:59:29,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:59:29,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:59:29,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:59:29,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:59:29,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:59:29,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:59:29,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:59:29,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:59:29,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:59:29,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:59:29,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:59:29,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:59:29,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:59:29,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:59:29,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:59:29,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:59:29,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:59:29,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:59:29,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:59:29,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:59:29,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:59:29,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:59:29,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:59:29,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:59:29,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:59:29,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:59:29,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:59:29,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:59:29,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:59:29,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:59:29,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:59:29,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:59:29,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:59:29,958 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:59:29,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:59:29,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:59:29,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:59:29,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:59:29,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:59:29,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:59:29,959 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:59:29,960 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:59:29,960 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:59:29,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:59:29,960 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:59:29,961 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:59:29,961 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:59:29,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:59:29,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:59:29,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:59:29,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:59:29,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:59:29,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:59:29,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:59:29,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:59:29,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/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_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab [2022-11-21 16:59:30,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:59:30,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:59:30,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:59:30,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:59:30,374 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:59:30,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2022-11-21 16:59:34,176 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:59:34,516 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:59:34,516 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2022-11-21 16:59:34,531 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/data/169f40617/c020604a6fac4f368fd486841dd4cc60/FLAGbc0c6ab71 [2022-11-21 16:59:34,550 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/data/169f40617/c020604a6fac4f368fd486841dd4cc60 [2022-11-21 16:59:34,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:59:34,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:59:34,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:59:34,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:59:34,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:59:34,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:59:34" (1/1) ... [2022-11-21 16:59:34,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e53a752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:34, skipping insertion in model container [2022-11-21 16:59:34,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:59:34" (1/1) ... [2022-11-21 16:59:34,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:59:34,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:59:34,964 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2022-11-21 16:59:34,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:59:34,980 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:59:35,030 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2022-11-21 16:59:35,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:59:35,061 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:59:35,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35 WrapperNode [2022-11-21 16:59:35,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:59:35,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:59:35,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:59:35,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:59:35,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,108 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-11-21 16:59:35,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:59:35,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:59:35,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:59:35,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:59:35,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:59:35,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:59:35,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:59:35,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:59:35,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (1/1) ... [2022-11-21 16:59:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:59:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:59:35,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:59:35,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:59:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-21 16:59:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-21 16:59:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:59:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:59:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:59:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:59:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:59:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:59:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:59:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:59:35,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:59:35,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:59:35,348 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:59:35,350 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:59:35,403 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-21 16:59:35,974 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:59:35,990 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:59:36,001 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:59:36,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:59:36 BoogieIcfgContainer [2022-11-21 16:59:36,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:59:36,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:59:36,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:59:36,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:59:36,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:59:34" (1/3) ... [2022-11-21 16:59:36,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59780dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:59:36, skipping insertion in model container [2022-11-21 16:59:36,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:59:35" (2/3) ... [2022-11-21 16:59:36,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59780dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:59:36, skipping insertion in model container [2022-11-21 16:59:36,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:59:36" (3/3) ... [2022-11-21 16:59:36,018 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2022-11-21 16:59:36,040 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:59:36,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-11-21 16:59:36,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:59:36,106 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@725ea748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:59:36,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2022-11-21 16:59:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:36,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:59:36,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:36,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:59:36,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-21 16:59:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108399487] [2022-11-21 16:59:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:36,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108399487] [2022-11-21 16:59:36,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108399487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:36,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:36,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:59:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486891485] [2022-11-21 16:59:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:36,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:59:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:59:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:59:36,531 INFO L87 Difference]: Start difference. First operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2022-11-21 16:59:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:36,772 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2022-11-21 16:59:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:59:36,777 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 [2022-11-21 16:59:36,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:36,788 INFO L225 Difference]: With dead ends: 123 [2022-11-21 16:59:36,789 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 16:59:36,791 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:59:36,797 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:36,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 85 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 16:59:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2022-11-21 16:59:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 2.0) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-11-21 16:59:36,847 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 4 [2022-11-21 16:59:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:36,848 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-11-21 16:59:36,848 INFO L496 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) [2022-11-21 16:59:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-11-21 16:59:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-21 16:59:36,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:36,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-21 16:59:36,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:59:36,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-21 16:59:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:36,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130305170] [2022-11-21 16:59:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:36,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130305170] [2022-11-21 16:59:36,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130305170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:36,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:36,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:59:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563522010] [2022-11-21 16:59:36,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:59:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:59:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:59:36,951 INFO L87 Difference]: Start difference. First operand 96 states and 104 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) [2022-11-21 16:59:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:37,029 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-11-21 16:59:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:59:37,030 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 [2022-11-21 16:59:37,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:37,031 INFO L225 Difference]: With dead ends: 95 [2022-11-21 16:59:37,031 INFO L226 Difference]: Without dead ends: 95 [2022-11-21 16:59:37,031 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:59:37,033 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:37,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 65 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-21 16:59:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-21 16:59:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-11-21 16:59:37,043 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 4 [2022-11-21 16:59:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:37,043 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-11-21 16:59:37,043 INFO L496 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) [2022-11-21 16:59:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-11-21 16:59:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:59:37,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:37,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:37,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:59:37,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:37,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304377, now seen corresponding path program 1 times [2022-11-21 16:59:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:37,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280863459] [2022-11-21 16:59:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280863459] [2022-11-21 16:59:37,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280863459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:37,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:37,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:59:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460093483] [2022-11-21 16:59:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:37,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:59:37,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:59:37,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:59:37,165 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:37,376 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-21 16:59:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:59:37,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 16:59:37,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:37,378 INFO L225 Difference]: With dead ends: 105 [2022-11-21 16:59:37,378 INFO L226 Difference]: Without dead ends: 105 [2022-11-21 16:59:37,379 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:59:37,385 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 168 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:37,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 52 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-21 16:59:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-11-21 16:59:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 86 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) [2022-11-21 16:59:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-11-21 16:59:37,414 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 9 [2022-11-21 16:59:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:37,414 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-11-21 16:59:37,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-11-21 16:59:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:59:37,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:37,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:37,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:59:37,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304378, now seen corresponding path program 1 times [2022-11-21 16:59:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:37,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212364964] [2022-11-21 16:59:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:37,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:37,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212364964] [2022-11-21 16:59:37,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212364964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:37,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:37,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:59:37,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909330140] [2022-11-21 16:59:37,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:37,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:59:37,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:37,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:59:37,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:59:37,719 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:38,011 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-11-21 16:59:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:59:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 16:59:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:38,013 INFO L225 Difference]: With dead ends: 123 [2022-11-21 16:59:38,013 INFO L226 Difference]: Without dead ends: 123 [2022-11-21 16:59:38,014 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:59:38,015 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 180 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:38,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-21 16:59:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-11-21 16:59:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-11-21 16:59:38,024 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 9 [2022-11-21 16:59:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:38,025 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-11-21 16:59:38,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-11-21 16:59:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:59:38,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:38,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:38,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:59:38,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 990774777, now seen corresponding path program 1 times [2022-11-21 16:59:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422820899] [2022-11-21 16:59:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:38,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422820899] [2022-11-21 16:59:38,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422820899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:38,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:38,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:59:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360607286] [2022-11-21 16:59:38,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:38,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:59:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:38,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:59:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:59:38,167 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2022-11-21 16:59:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:38,375 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2022-11-21 16:59:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:59:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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 15 [2022-11-21 16:59:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:38,378 INFO L225 Difference]: With dead ends: 156 [2022-11-21 16:59:38,378 INFO L226 Difference]: Without dead ends: 156 [2022-11-21 16:59:38,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:59:38,379 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:38,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 250 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-21 16:59:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2022-11-21 16:59:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 112 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-11-21 16:59:38,388 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 15 [2022-11-21 16:59:38,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:38,388 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-11-21 16:59:38,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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) [2022-11-21 16:59:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-11-21 16:59:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:59:38,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:38,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:38,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:59:38,391 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1321200184, now seen corresponding path program 1 times [2022-11-21 16:59:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792160513] [2022-11-21 16:59:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:38,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:38,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792160513] [2022-11-21 16:59:38,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792160513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:38,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:38,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:59:38,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004664980] [2022-11-21 16:59:38,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:38,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:59:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:59:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:59:38,559 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:38,875 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-11-21 16:59:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 16:59:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:38,877 INFO L225 Difference]: With dead ends: 169 [2022-11-21 16:59:38,877 INFO L226 Difference]: Without dead ends: 169 [2022-11-21 16:59:38,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:38,878 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 145 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:38,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 221 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:59:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-21 16:59:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2022-11-21 16:59:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2022-11-21 16:59:38,886 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 17 [2022-11-21 16:59:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:38,887 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2022-11-21 16:59:38,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2022-11-21 16:59:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:59:38,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:38,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:38,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:59:38,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:38,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1496225836, now seen corresponding path program 1 times [2022-11-21 16:59:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:38,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45007223] [2022-11-21 16:59:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:38,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45007223] [2022-11-21 16:59:38,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45007223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:38,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:38,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:59:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438587949] [2022-11-21 16:59:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:38,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:59:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:59:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:59:38,970 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:39,123 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2022-11-21 16:59:39,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:59:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 19 [2022-11-21 16:59:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:39,125 INFO L225 Difference]: With dead ends: 122 [2022-11-21 16:59:39,125 INFO L226 Difference]: Without dead ends: 122 [2022-11-21 16:59:39,125 INFO L412 NwaCegarLoop]: 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 [2022-11-21 16:59:39,126 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 157 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:39,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 84 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:59:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-21 16:59:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2022-11-21 16:59:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-11-21 16:59:39,133 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 19 [2022-11-21 16:59:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:39,134 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-11-21 16:59:39,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-11-21 16:59:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:59:39,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:39,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:39,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:59:39,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash 893457289, now seen corresponding path program 1 times [2022-11-21 16:59:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:39,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064998153] [2022-11-21 16:59:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:39,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064998153] [2022-11-21 16:59:39,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064998153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:39,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:39,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:59:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32900710] [2022-11-21 16:59:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:59:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:59:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:59:39,294 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:39,513 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2022-11-21 16:59:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:59:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:59:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:39,515 INFO L225 Difference]: With dead ends: 151 [2022-11-21 16:59:39,515 INFO L226 Difference]: Without dead ends: 141 [2022-11-21 16:59:39,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:39,517 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 85 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:39,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 201 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-21 16:59:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-11-21 16:59:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-11-21 16:59:39,523 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2022-11-21 16:59:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:39,524 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-11-21 16:59:39,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-11-21 16:59:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:59:39,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:39,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:39,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:59:39,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608044, now seen corresponding path program 1 times [2022-11-21 16:59:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453779259] [2022-11-21 16:59:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:39,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453779259] [2022-11-21 16:59:39,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453779259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:39,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:39,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:59:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979067827] [2022-11-21 16:59:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:59:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:39,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:59:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:59:39,698 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:39,969 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-11-21 16:59:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:39,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:59:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:39,971 INFO L225 Difference]: With dead ends: 120 [2022-11-21 16:59:39,971 INFO L226 Difference]: Without dead ends: 120 [2022-11-21 16:59:39,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:59:39,973 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 119 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:39,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 185 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-21 16:59:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-11-21 16:59:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-11-21 16:59:39,978 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 22 [2022-11-21 16:59:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:39,978 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-11-21 16:59:39,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-11-21 16:59:39,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:59:39,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:39,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:39,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:59:39,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608043, now seen corresponding path program 1 times [2022-11-21 16:59:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:39,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314802383] [2022-11-21 16:59:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:40,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314802383] [2022-11-21 16:59:40,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314802383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:40,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:40,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:59:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259890593] [2022-11-21 16:59:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:40,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:59:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:40,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:59:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:59:40,324 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:40,679 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-11-21 16:59:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:59:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:59:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:40,681 INFO L225 Difference]: With dead ends: 117 [2022-11-21 16:59:40,681 INFO L226 Difference]: Without dead ends: 117 [2022-11-21 16:59:40,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:59:40,682 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:40,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 253 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-21 16:59:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-11-21 16:59:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.369047619047619) internal successors, (115), 99 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2022-11-21 16:59:40,687 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 22 [2022-11-21 16:59:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:40,687 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2022-11-21 16:59:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2022-11-21 16:59:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 16:59:40,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:40,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:40,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:59:40,690 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1076428849, now seen corresponding path program 1 times [2022-11-21 16:59:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:40,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986490111] [2022-11-21 16:59:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:59:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:41,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986490111] [2022-11-21 16:59:41,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986490111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:41,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:59:41,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:59:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239629056] [2022-11-21 16:59:41,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:59:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:41,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:59:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:59:41,175 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:41,508 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2022-11-21 16:59:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:59:41,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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 25 [2022-11-21 16:59:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:41,510 INFO L225 Difference]: With dead ends: 107 [2022-11-21 16:59:41,510 INFO L226 Difference]: Without dead ends: 98 [2022-11-21 16:59:41,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:59:41,511 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 117 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:41,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-21 16:59:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-11-21 16:59:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2022-11-21 16:59:41,515 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 25 [2022-11-21 16:59:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:41,515 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2022-11-21 16:59:41,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-11-21 16:59:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:59:41,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:41,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:41,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:59:41,517 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash 762143636, now seen corresponding path program 1 times [2022-11-21 16:59:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:41,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999226901] [2022-11-21 16:59:41,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:41,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:41,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999226901] [2022-11-21 16:59:41,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999226901] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:59:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011099387] [2022-11-21 16:59:41,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:59:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:59:41,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:59:41,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:59:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:41,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 16:59:41,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:59:42,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:59:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:59:42,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:59:42,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011099387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:59:42,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:59:42,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-11-21 16:59:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129709751] [2022-11-21 16:59:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:59:42,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:59:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:59:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:59:42,078 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:42,294 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-11-21 16:59:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:59:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-21 16:59:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:42,296 INFO L225 Difference]: With dead ends: 140 [2022-11-21 16:59:42,296 INFO L226 Difference]: Without dead ends: 140 [2022-11-21 16:59:42,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:59:42,298 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:42,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 301 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-21 16:59:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2022-11-21 16:59:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3875) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-11-21 16:59:42,303 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 28 [2022-11-21 16:59:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:42,303 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-11-21 16:59:42,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-11-21 16:59:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 16:59:42,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:42,311 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:42,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:59:42,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-21 16:59:42,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1442202006, now seen corresponding path program 1 times [2022-11-21 16:59:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:42,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932135393] [2022-11-21 16:59:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:42,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:42,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932135393] [2022-11-21 16:59:42,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932135393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:59:42,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716022007] [2022-11-21 16:59:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:42,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:59:42,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:59:42,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:59:42,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:59:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:42,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:59:42,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:59:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:42,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:59:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:42,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716022007] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:59:42,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:59:42,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-21 16:59:42,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877143509] [2022-11-21 16:59:42,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:59:42,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:59:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:59:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:59:42,962 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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) [2022-11-21 16:59:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:43,187 INFO L93 Difference]: Finished difference Result 324 states and 370 transitions. [2022-11-21 16:59:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:59:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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 [2022-11-21 16:59:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:43,189 INFO L225 Difference]: With dead ends: 324 [2022-11-21 16:59:43,189 INFO L226 Difference]: Without dead ends: 324 [2022-11-21 16:59:43,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:59:43,191 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 233 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:43,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 501 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:59:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-21 16:59:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 137. [2022-11-21 16:59:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-11-21 16:59:43,200 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 28 [2022-11-21 16:59:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:43,202 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-11-21 16:59:43,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 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) [2022-11-21 16:59:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-11-21 16:59:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 16:59:43,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:43,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:43,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:59:43,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 16:59:43,413 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1992394589, now seen corresponding path program 1 times [2022-11-21 16:59:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:43,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226942939] [2022-11-21 16:59:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:43,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226942939] [2022-11-21 16:59:43,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226942939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:59:43,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659694661] [2022-11-21 16:59:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:43,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:59:43,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:59:43,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:59:43,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:59:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:43,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 16:59:43,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:59:44,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:59:44,139 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:59:44,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:59:44,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:59:44,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 16:59:44,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:59:44,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 16:59:44,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:59:44,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:59:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:44,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:59:44,511 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-21 16:59:44,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-11-21 16:59:44,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:59:44,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-21 16:59:44,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:59:44,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-21 16:59:44,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 16:59:44,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:59:44,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 16:59:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 16:59:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659694661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:59:45,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:59:45,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-11-21 16:59:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140104932] [2022-11-21 16:59:45,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:59:45,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 16:59:45,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 16:59:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=8, NotChecked=102, Total=812 [2022-11-21 16:59:45,107 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:59:46,263 INFO L93 Difference]: Finished difference Result 270 states and 299 transitions. [2022-11-21 16:59:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:59:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 16:59:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:59:46,265 INFO L225 Difference]: With dead ends: 270 [2022-11-21 16:59:46,265 INFO L226 Difference]: Without dead ends: 270 [2022-11-21 16:59:46,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=926, Unknown=9, NotChecked=134, Total=1332 [2022-11-21 16:59:46,266 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 388 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 47 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:59:46,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 738 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 959 Invalid, 5 Unknown, 349 Unchecked, 0.8s Time] [2022-11-21 16:59:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-21 16:59:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 153. [2022-11-21 16:59:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2022-11-21 16:59:46,270 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 30 [2022-11-21 16:59:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:59:46,271 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2022-11-21 16:59:46,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2022-11-21 16:59:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 16:59:46,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:59:46,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:59:46,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:59:46,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 16:59:46,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 16:59:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:59:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1992702419, now seen corresponding path program 1 times [2022-11-21 16:59:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:59:46,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486298148] [2022-11-21 16:59:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:59:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:47,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:59:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486298148] [2022-11-21 16:59:47,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486298148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:59:47,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123431449] [2022-11-21 16:59:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:59:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:59:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:59:47,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:59:47,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:59:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:59:47,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 16:59:47,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:59:47,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:59:47,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:59:47,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 16:59:47,288 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:59:47,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:59:47,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 16:59:47,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 16:59:47,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-21 16:59:47,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 16:59:47,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 16:59:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:59:47,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:59:47,474 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-21 16:59:47,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-21 16:59:47,528 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-11-21 16:59:47,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:59:47,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-11-21 16:59:47,837 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-21 16:59:47,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2022-11-21 16:59:47,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:59:47,855 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 16:59:47,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-21 16:59:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 16:59:47,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123431449] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:59:47,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:59:47,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2022-11-21 16:59:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267858247] [2022-11-21 16:59:47,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:59:47,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 16:59:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:59:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 16:59:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=413, Unknown=4, NotChecked=132, Total=650 [2022-11-21 16:59:47,918 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:59:55,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:59:57,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:59:59,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:00:01,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:00:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:04,512 INFO L93 Difference]: Finished difference Result 270 states and 301 transitions. [2022-11-21 17:00:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:00:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 17:00:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:04,513 INFO L225 Difference]: With dead ends: 270 [2022-11-21 17:00:04,513 INFO L226 Difference]: Without dead ends: 270 [2022-11-21 17:00:04,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=270, Invalid=924, Unknown=8, NotChecked=204, Total=1406 [2022-11-21 17:00:04,515 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 473 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 71 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:04,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 655 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 919 Invalid, 16 Unknown, 372 Unchecked, 9.6s Time] [2022-11-21 17:00:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-21 17:00:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 173. [2022-11-21 17:00:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 172 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-11-21 17:00:04,519 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 30 [2022-11-21 17:00:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:04,519 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-11-21 17:00:04,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-11-21 17:00:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:00:04,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:04,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:04,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:04,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:04,721 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1374608061, now seen corresponding path program 1 times [2022-11-21 17:00:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:04,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175479007] [2022-11-21 17:00:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:05,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175479007] [2022-11-21 17:00:05,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175479007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:05,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527389164] [2022-11-21 17:00:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:05,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:05,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:05,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:05,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:00:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:05,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 17:00:05,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:05,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:05,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:00:05,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-21 17:00:05,710 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:05,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:05,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:05,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-21 17:00:05,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:00:05,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-21 17:00:06,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-21 17:00:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:06,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:06,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_62| Int)) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_62| 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_62|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_62| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-21 17:00:06,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:06,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-11-21 17:00:06,931 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-21 17:00:06,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-21 17:00:06,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-21 17:00:06,950 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:00:06,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-21 17:00:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:00:07,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527389164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:07,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:07,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 38 [2022-11-21 17:00:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276995678] [2022-11-21 17:00:07,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:07,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 17:00:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 17:00:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1105, Unknown=7, NotChecked=70, Total=1406 [2022-11-21 17:00:07,092 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:10,513 INFO L93 Difference]: Finished difference Result 295 states and 332 transitions. [2022-11-21 17:00:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 17:00:10,513 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 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 30 [2022-11-21 17:00:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:10,515 INFO L225 Difference]: With dead ends: 295 [2022-11-21 17:00:10,515 INFO L226 Difference]: Without dead ends: 295 [2022-11-21 17:00:10,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=442, Invalid=1717, Unknown=7, NotChecked=90, Total=2256 [2022-11-21 17:00:10,516 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 621 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 103 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:10,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1148 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1679 Invalid, 4 Unknown, 150 Unchecked, 2.5s Time] [2022-11-21 17:00:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-21 17:00:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 211. [2022-11-21 17:00:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 195 states have (on average 1.2461538461538462) internal successors, (243), 210 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 243 transitions. [2022-11-21 17:00:10,523 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 243 transitions. Word has length 30 [2022-11-21 17:00:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:10,523 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 243 transitions. [2022-11-21 17:00:10,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 243 transitions. [2022-11-21 17:00:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:00:10,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:10,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:10,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:10,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 17:00:10,730 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1374915891, now seen corresponding path program 1 times [2022-11-21 17:00:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:10,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436923156] [2022-11-21 17:00:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436923156] [2022-11-21 17:00:11,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436923156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825648248] [2022-11-21 17:00:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:11,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:11,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:11,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:11,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:00:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:11,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 17:00:11,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:11,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:00:11,409 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:11,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:11,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:00:11,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:00:11,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:11,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:00:11,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:11,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:11,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:11,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-21 17:00:11,759 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-21 17:00:11,817 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 Int) (v_ArrVal_588 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8) v_ArrVal_585)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-21 17:00:11,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:11,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-21 17:00:11,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:11,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-21 17:00:11,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:00:12,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:12,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:00:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:00:12,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825648248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:12,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:12,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-11-21 17:00:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948409737] [2022-11-21 17:00:12,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:12,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-21 17:00:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-21 17:00:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=528, Unknown=4, NotChecked=150, Total=812 [2022-11-21 17:00:12,249 INFO L87 Difference]: Start difference. First operand 211 states and 243 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:18,188 INFO L93 Difference]: Finished difference Result 327 states and 364 transitions. [2022-11-21 17:00:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:00:18,189 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 17:00:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:18,191 INFO L225 Difference]: With dead ends: 327 [2022-11-21 17:00:18,191 INFO L226 Difference]: Without dead ends: 327 [2022-11-21 17:00:18,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=258, Invalid=872, Unknown=4, NotChecked=198, Total=1332 [2022-11-21 17:00:18,193 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 351 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:18,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 914 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1184 Invalid, 2 Unknown, 533 Unchecked, 1.4s Time] [2022-11-21 17:00:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-21 17:00:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 219. [2022-11-21 17:00:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2022-11-21 17:00:18,201 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 30 [2022-11-21 17:00:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:18,201 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2022-11-21 17:00:18,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2022-11-21 17:00:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 17:00:18,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:18,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:18,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:18,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 17:00:18,411 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 864210937, now seen corresponding path program 1 times [2022-11-21 17:00:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:18,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607436090] [2022-11-21 17:00:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:19,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607436090] [2022-11-21 17:00:19,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607436090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:19,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121362364] [2022-11-21 17:00:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:19,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:19,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:19,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:00:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:19,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 17:00:19,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:19,425 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:00:19,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:00:19,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:19,699 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:00:19,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 17:00:19,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:00:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:19,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:20,051 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-21 17:00:20,061 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-21 17:00:20,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:20,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-21 17:00:20,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:20,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-21 17:00:20,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-21 17:00:24,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:24,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2022-11-21 17:00:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121362364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:27,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-11-21 17:00:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669289543] [2022-11-21 17:00:27,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:27,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-21 17:00:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:27,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-21 17:00:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=761, Unknown=5, NotChecked=118, Total=1056 [2022-11-21 17:00:27,816 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:29,308 INFO L93 Difference]: Finished difference Result 298 states and 335 transitions. [2022-11-21 17:00:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 17:00:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-21 17:00:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:29,311 INFO L225 Difference]: With dead ends: 298 [2022-11-21 17:00:29,311 INFO L226 Difference]: Without dead ends: 298 [2022-11-21 17:00:29,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=312, Invalid=1173, Unknown=5, NotChecked=150, Total=1640 [2022-11-21 17:00:29,313 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 610 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:29,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 675 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1068 Invalid, 0 Unknown, 316 Unchecked, 1.1s Time] [2022-11-21 17:00:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-21 17:00:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 222. [2022-11-21 17:00:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 206 states have (on average 1.2427184466019416) internal successors, (256), 221 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 256 transitions. [2022-11-21 17:00:29,319 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 256 transitions. Word has length 32 [2022-11-21 17:00:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:29,319 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 256 transitions. [2022-11-21 17:00:29,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 256 transitions. [2022-11-21 17:00:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 17:00:29,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:29,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:29,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:29,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:00:29,527 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash 864210938, now seen corresponding path program 1 times [2022-11-21 17:00:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:29,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626024660] [2022-11-21 17:00:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:30,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:30,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626024660] [2022-11-21 17:00:30,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626024660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:30,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566268788] [2022-11-21 17:00:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:30,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:30,194 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:30,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:00:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:30,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 17:00:30,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:30,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:00:30,529 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:30,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:30,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:30,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:30,877 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:00:30,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-21 17:00:30,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 17:00:31,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:00:31,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:31,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:31,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-21 17:00:31,390 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_735 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-21 17:00:31,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:31,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-21 17:00:31,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:31,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-21 17:00:31,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:31,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2022-11-21 17:00:31,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:31,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2022-11-21 17:00:31,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-21 17:00:31,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-11-21 17:00:31,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:31,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 17:00:31,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:00:31,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:00:31,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:00:31,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:31,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:00:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:00:32,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566268788] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:32,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:32,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-11-21 17:00:32,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310918348] [2022-11-21 17:00:32,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:32,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-21 17:00:32,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-21 17:00:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=896, Unknown=14, NotChecked=126, Total=1190 [2022-11-21 17:00:32,146 INFO L87 Difference]: Start difference. First operand 222 states and 256 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:33,910 INFO L93 Difference]: Finished difference Result 305 states and 346 transitions. [2022-11-21 17:00:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:00:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-21 17:00:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:33,911 INFO L225 Difference]: With dead ends: 305 [2022-11-21 17:00:33,911 INFO L226 Difference]: Without dead ends: 305 [2022-11-21 17:00:33,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=472, Invalid=1972, Unknown=14, NotChecked=194, Total=2652 [2022-11-21 17:00:33,913 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 799 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:33,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 750 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 991 Invalid, 0 Unknown, 302 Unchecked, 0.9s Time] [2022-11-21 17:00:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-21 17:00:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 217. [2022-11-21 17:00:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 204 states have (on average 1.2254901960784315) internal successors, (250), 216 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2022-11-21 17:00:33,926 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 32 [2022-11-21 17:00:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:33,927 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2022-11-21 17:00:33,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2022-11-21 17:00:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 17:00:33,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:33,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:33,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:34,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:34,131 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1554334094, now seen corresponding path program 1 times [2022-11-21 17:00:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:34,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907422286] [2022-11-21 17:00:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907422286] [2022-11-21 17:00:34,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907422286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:34,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615642305] [2022-11-21 17:00:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:34,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:34,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:34,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:00:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:34,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 17:00:34,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:34,806 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:34,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:34,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 17:00:35,069 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:00:35,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:00:35,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:35,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-21 17:00:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:35,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:35,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-11-21 17:00:35,669 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_87| Int)) (or (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_87|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_87| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_87| 8)) 0)))) is different from false [2022-11-21 17:00:35,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:35,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-21 17:00:35,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:35,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-11-21 17:00:35,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-21 17:00:36,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:36,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 52 [2022-11-21 17:00:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:36,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615642305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:36,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:36,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-11-21 17:00:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159207252] [2022-11-21 17:00:36,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:36,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 17:00:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 17:00:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=773, Unknown=4, NotChecked=114, Total=992 [2022-11-21 17:00:36,285 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:39,837 INFO L93 Difference]: Finished difference Result 409 states and 459 transitions. [2022-11-21 17:00:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-21 17:00:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 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 35 [2022-11-21 17:00:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:39,840 INFO L225 Difference]: With dead ends: 409 [2022-11-21 17:00:39,840 INFO L226 Difference]: Without dead ends: 407 [2022-11-21 17:00:39,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=738, Invalid=3298, Unknown=4, NotChecked=250, Total=4290 [2022-11-21 17:00:39,843 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1221 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:39,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 832 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1108 Invalid, 0 Unknown, 393 Unchecked, 1.3s Time] [2022-11-21 17:00:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-21 17:00:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 243. [2022-11-21 17:00:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 230 states have (on average 1.2521739130434784) internal successors, (288), 242 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2022-11-21 17:00:39,860 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 35 [2022-11-21 17:00:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:39,860 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2022-11-21 17:00:39,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2022-11-21 17:00:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 17:00:39,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:39,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:39,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:40,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:40,068 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 357730772, now seen corresponding path program 1 times [2022-11-21 17:00:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:40,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321567703] [2022-11-21 17:00:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:00:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:40,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321567703] [2022-11-21 17:00:40,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321567703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:40,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71743339] [2022-11-21 17:00:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:40,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:40,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:40,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:40,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 17:00:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:40,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-21 17:00:40,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:40,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:40,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:40,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71743339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:40,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:40,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-11-21 17:00:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397540032] [2022-11-21 17:00:40,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:40,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 17:00:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 17:00:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-21 17:00:40,641 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:41,120 INFO L93 Difference]: Finished difference Result 560 states and 665 transitions. [2022-11-21 17:00:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 17:00:41,121 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 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 36 [2022-11-21 17:00:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:41,123 INFO L225 Difference]: With dead ends: 560 [2022-11-21 17:00:41,123 INFO L226 Difference]: Without dead ends: 560 [2022-11-21 17:00:41,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2022-11-21 17:00:41,124 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 528 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:41,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 656 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:00:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-21 17:00:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 354. [2022-11-21 17:00:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 341 states have (on average 1.3313782991202345) internal successors, (454), 353 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 454 transitions. [2022-11-21 17:00:41,145 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 454 transitions. Word has length 36 [2022-11-21 17:00:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:41,145 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 454 transitions. [2022-11-21 17:00:41,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 454 transitions. [2022-11-21 17:00:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:00:41,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:41,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:41,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:41,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:41,360 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:41,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash -929852094, now seen corresponding path program 1 times [2022-11-21 17:00:41,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:41,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316841870] [2022-11-21 17:00:41,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:41,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:00:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:41,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316841870] [2022-11-21 17:00:41,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316841870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:00:41,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:00:41,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:00:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21357436] [2022-11-21 17:00:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:00:41,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:00:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:00:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:00:41,484 INFO L87 Difference]: Start difference. First operand 354 states and 454 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:41,637 INFO L93 Difference]: Finished difference Result 353 states and 452 transitions. [2022-11-21 17:00:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:00:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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 37 [2022-11-21 17:00:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:41,643 INFO L225 Difference]: With dead ends: 353 [2022-11-21 17:00:41,643 INFO L226 Difference]: Without dead ends: 353 [2022-11-21 17:00:41,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:00:41,644 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:41,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:00:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-21 17:00:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2022-11-21 17:00:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 339 states have (on average 1.3303834808259587) internal successors, (451), 351 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 451 transitions. [2022-11-21 17:00:41,652 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 451 transitions. Word has length 37 [2022-11-21 17:00:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:41,653 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 451 transitions. [2022-11-21 17:00:41,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 451 transitions. [2022-11-21 17:00:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 17:00:41,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:41,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 17:00:41,660 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash 208867043, now seen corresponding path program 1 times [2022-11-21 17:00:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:41,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685513464] [2022-11-21 17:00:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:41,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:42,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:42,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685513464] [2022-11-21 17:00:42,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685513464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:42,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648614602] [2022-11-21 17:00:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:42,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:42,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 17:00:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:42,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-21 17:00:42,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:42,561 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:42,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:42,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:42,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:42,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:00:42,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-21 17:00:42,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-21 17:00:42,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 17:00:42,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-21 17:00:42,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-21 17:00:42,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:42,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:42,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-11-21 17:00:42,923 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-11-21 17:00:42,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_986 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-21 17:00:43,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:43,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 17:00:43,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:43,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-21 17:00:43,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:00:43,074 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-21 17:00:43,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-21 17:00:43,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:43,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:00:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:00:43,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648614602] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:43,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:43,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28 [2022-11-21 17:00:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182360443] [2022-11-21 17:00:43,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:43,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 17:00:43,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 17:00:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=555, Unknown=3, NotChecked=98, Total=756 [2022-11-21 17:00:43,481 INFO L87 Difference]: Start difference. First operand 352 states and 451 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:44,480 INFO L93 Difference]: Finished difference Result 351 states and 417 transitions. [2022-11-21 17:00:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:00:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 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 38 [2022-11-21 17:00:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:44,482 INFO L225 Difference]: With dead ends: 351 [2022-11-21 17:00:44,482 INFO L226 Difference]: Without dead ends: 351 [2022-11-21 17:00:44,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1025, Unknown=3, NotChecked=138, Total=1406 [2022-11-21 17:00:44,483 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 567 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:44,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 494 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 628 Invalid, 1 Unknown, 243 Unchecked, 0.6s Time] [2022-11-21 17:00:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-21 17:00:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 310. [2022-11-21 17:00:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 297 states have (on average 1.2693602693602695) internal successors, (377), 309 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 377 transitions. [2022-11-21 17:00:44,490 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 377 transitions. Word has length 38 [2022-11-21 17:00:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:44,490 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 377 transitions. [2022-11-21 17:00:44,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 377 transitions. [2022-11-21 17:00:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 17:00:44,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:44,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:44,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:44,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:44,692 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1693817782, now seen corresponding path program 1 times [2022-11-21 17:00:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:44,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136551950] [2022-11-21 17:00:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:00:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:45,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136551950] [2022-11-21 17:00:45,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136551950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:45,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529852273] [2022-11-21 17:00:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:45,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:45,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:45,079 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:45,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 17:00:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:45,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 17:00:45,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:45,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:00:45,440 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:45,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:45,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:00:45,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:00:45,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:00:45,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:45,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:00:45,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:46,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:46,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-21 17:00:46,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:46,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-21 17:00:46,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-21 17:00:46,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:46,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:00:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:00:46,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529852273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:46,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:46,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2022-11-21 17:00:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023993544] [2022-11-21 17:00:46,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:46,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-21 17:00:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-21 17:00:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=887, Unknown=16, NotChecked=0, Total=1056 [2022-11-21 17:00:46,509 INFO L87 Difference]: Start difference. First operand 310 states and 377 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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) [2022-11-21 17:00:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:49,077 INFO L93 Difference]: Finished difference Result 415 states and 480 transitions. [2022-11-21 17:00:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 17:00:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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) Word has length 38 [2022-11-21 17:00:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:49,079 INFO L225 Difference]: With dead ends: 415 [2022-11-21 17:00:49,079 INFO L226 Difference]: Without dead ends: 415 [2022-11-21 17:00:49,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=2152, Unknown=24, NotChecked=0, Total=2652 [2022-11-21 17:00:49,081 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 488 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 81 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:49,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 930 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1234 Invalid, 12 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 17:00:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-21 17:00:49,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 310. [2022-11-21 17:00:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 297 states have (on average 1.265993265993266) internal successors, (376), 309 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 376 transitions. [2022-11-21 17:00:49,089 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 376 transitions. Word has length 38 [2022-11-21 17:00:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:49,089 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 376 transitions. [2022-11-21 17:00:49,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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) [2022-11-21 17:00:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 376 transitions. [2022-11-21 17:00:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 17:00:49,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:49,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:49,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:49,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 17:00:49,297 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1038799272, now seen corresponding path program 2 times [2022-11-21 17:00:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:49,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780619526] [2022-11-21 17:00:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780619526] [2022-11-21 17:00:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780619526] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664246187] [2022-11-21 17:00:50,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:00:50,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:50,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:50,008 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:50,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 17:00:50,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:00:50,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:00:50,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 17:00:50,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:50,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:00:50,424 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:50,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:50,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:50,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:00:50,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:00:50,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:00:50,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:50,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:50,783 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:00:50,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:00:50,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-21 17:00:50,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:50,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:00:51,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:51,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:51,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:51,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1184) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-11-21 17:00:51,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:51,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 89 [2022-11-21 17:00:52,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2022-11-21 17:00:52,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:52,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:00:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 17:00:52,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664246187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:52,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:52,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2022-11-21 17:00:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165829690] [2022-11-21 17:00:52,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:52,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-21 17:00:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-21 17:00:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1194, Unknown=10, NotChecked=72, Total=1482 [2022-11-21 17:00:52,731 INFO L87 Difference]: Start difference. First operand 310 states and 376 transitions. Second operand has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:00:54,350 INFO L93 Difference]: Finished difference Result 472 states and 560 transitions. [2022-11-21 17:00:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 17:00:54,351 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 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 [2022-11-21 17:00:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:00:54,353 INFO L225 Difference]: With dead ends: 472 [2022-11-21 17:00:54,353 INFO L226 Difference]: Without dead ends: 472 [2022-11-21 17:00:54,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=447, Invalid=1997, Unknown=10, NotChecked=96, Total=2550 [2022-11-21 17:00:54,355 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 386 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:00:54,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 907 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1201 Invalid, 0 Unknown, 161 Unchecked, 1.0s Time] [2022-11-21 17:00:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-21 17:00:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 310. [2022-11-21 17:00:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 297 states have (on average 1.2525252525252526) internal successors, (372), 309 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) [2022-11-21 17:00:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 372 transitions. [2022-11-21 17:00:54,362 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 372 transitions. Word has length 43 [2022-11-21 17:00:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:00:54,363 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 372 transitions. [2022-11-21 17:00:54,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:00:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 372 transitions. [2022-11-21 17:00:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 17:00:54,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:00:54,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:00:54,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:00:54,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 17:00:54,570 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:00:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:00:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash 745076370, now seen corresponding path program 1 times [2022-11-21 17:00:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:00:54,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257037834] [2022-11-21 17:00:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:00:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:00:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257037834] [2022-11-21 17:00:55,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257037834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:00:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263476804] [2022-11-21 17:00:55,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:00:55,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:00:55,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:00:55,172 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:00:55,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 17:00:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:00:55,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 17:00:55,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:00:55,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:00:55,549 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:00:55,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:00:55,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:00:55,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:00:55,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:55,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-21 17:00:55,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:55,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:55,920 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:00:55,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:00:55,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:55,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:00:56,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-21 17:00:56,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:00:56,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:00:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:00:56,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:00:56,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1305) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-21 17:00:56,251 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1305) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-21 17:00:56,257 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1305) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-11-21 17:00:56,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-11-21 17:00:57,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:00:57,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 117 [2022-11-21 17:00:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-21 17:00:57,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263476804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:00:57,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:00:57,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 40 [2022-11-21 17:00:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390236155] [2022-11-21 17:00:57,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:00:57,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 17:00:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:00:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 17:00:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1132, Unknown=3, NotChecked=216, Total=1560 [2022-11-21 17:00:57,332 INFO L87 Difference]: Start difference. First operand 310 states and 372 transitions. Second operand has 40 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:01:02,271 INFO L93 Difference]: Finished difference Result 472 states and 558 transitions. [2022-11-21 17:01:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 17:01:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 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 [2022-11-21 17:01:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:01:02,277 INFO L225 Difference]: With dead ends: 472 [2022-11-21 17:01:02,278 INFO L226 Difference]: Without dead ends: 472 [2022-11-21 17:01:02,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=532, Invalid=2232, Unknown=4, NotChecked=312, Total=3080 [2022-11-21 17:01:02,279 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 408 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:01:02,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1163 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1586 Invalid, 0 Unknown, 526 Unchecked, 1.5s Time] [2022-11-21 17:01:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-21 17:01:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 316. [2022-11-21 17:01:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2442244224422443) internal successors, (377), 315 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 377 transitions. [2022-11-21 17:01:02,288 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 377 transitions. Word has length 43 [2022-11-21 17:01:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:01:02,288 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 377 transitions. [2022-11-21 17:01:02,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.825) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 377 transitions. [2022-11-21 17:01:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:01:02,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:01:02,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:01:02,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 17:01:02,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 17:01:02,497 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:01:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:01:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684670, now seen corresponding path program 2 times [2022-11-21 17:01:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:01:02,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664504491] [2022-11-21 17:01:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:01:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:01:03,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664504491] [2022-11-21 17:01:03,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664504491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:01:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355441311] [2022-11-21 17:01:03,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:01:03,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:01:03,363 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:01:03,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 17:01:03,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:01:03,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:01:03,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-21 17:01:03,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:01:03,768 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:01:03,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:01:03,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:03,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:03,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:03,958 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:01:03,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:01:03,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 17:01:04,237 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-21 17:01:04,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 59 [2022-11-21 17:01:04,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-11-21 17:01:04,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-21 17:01:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:04,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:01:06,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1420 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1420) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-21 17:01:06,526 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1420 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1420) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-11-21 17:01:06,541 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-11-21 17:01:06,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-11-21 17:01:06,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:06,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-21 17:01:06,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:06,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:01:06,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:06,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2022-11-21 17:01:06,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-11-21 17:01:07,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:07,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2022-11-21 17:01:07,018 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 17:01:07,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-21 17:01:07,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:07,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:01:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 17:01:07,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355441311] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:01:07,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:01:07,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 37 [2022-11-21 17:01:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69869291] [2022-11-21 17:01:07,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:01:07,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 17:01:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:01:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 17:01:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1089, Unknown=11, NotChecked=138, Total=1406 [2022-11-21 17:01:07,608 INFO L87 Difference]: Start difference. First operand 316 states and 377 transitions. Second operand has 38 states, 37 states have (on average 2.810810810810811) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:01:11,673 INFO L93 Difference]: Finished difference Result 396 states and 470 transitions. [2022-11-21 17:01:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:01:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.810810810810811) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-21 17:01:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:01:11,677 INFO L225 Difference]: With dead ends: 396 [2022-11-21 17:01:11,678 INFO L226 Difference]: Without dead ends: 396 [2022-11-21 17:01:11,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=444, Invalid=2103, Unknown=11, NotChecked=198, Total=2756 [2022-11-21 17:01:11,680 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 747 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:01:11,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 724 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1124 Invalid, 0 Unknown, 264 Unchecked, 1.2s Time] [2022-11-21 17:01:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-21 17:01:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 316. [2022-11-21 17:01:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2409240924092408) internal successors, (376), 315 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 376 transitions. [2022-11-21 17:01:11,690 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 376 transitions. Word has length 45 [2022-11-21 17:01:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:01:11,691 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 376 transitions. [2022-11-21 17:01:11,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.810810810810811) internal successors, (104), 38 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 376 transitions. [2022-11-21 17:01:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:01:11,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:01:11,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:01:11,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-21 17:01:11,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-21 17:01:11,895 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:01:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:01:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684671, now seen corresponding path program 2 times [2022-11-21 17:01:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:01:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856082237] [2022-11-21 17:01:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:01:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:01:13,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856082237] [2022-11-21 17:01:13,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856082237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:01:13,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093754344] [2022-11-21 17:01:13,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:01:13,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:01:13,304 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:01:13,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 17:01:13,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:01:13,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:01:13,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-21 17:01:13,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:01:13,708 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:01:13,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:01:13,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:13,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:14,058 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:01:14,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-21 17:01:14,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:01:14,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:01:14,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-21 17:01:14,205 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:01:14,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-21 17:01:14,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:14,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:14,317 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-21 17:01:14,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 17:01:14,452 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:01:14,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-21 17:01:14,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:01:14,493 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-21 17:01:14,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-11-21 17:01:14,934 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:01:14,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2022-11-21 17:01:14,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 17:01:15,305 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:01:15,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-11-21 17:01:15,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:01:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:15,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:01:15,618 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1541) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_1542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-21 17:01:15,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:15,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-11-21 17:01:16,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:16,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-21 17:01:17,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-21 17:01:17,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 133 [2022-11-21 17:01:17,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-11-21 17:01:17,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-11-21 17:01:17,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:01:17,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:17,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:01:17,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-21 17:01:17,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-21 17:01:17,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:17,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:17,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:01:17,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:01:18,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:18,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-21 17:01:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-21 17:01:19,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093754344] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:01:19,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:01:19,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-21 17:01:19,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885119651] [2022-11-21 17:01:19,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:01:19,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 17:01:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:01:19,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 17:01:19,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1984, Unknown=44, NotChecked=92, Total=2352 [2022-11-21 17:01:19,696 INFO L87 Difference]: Start difference. First operand 316 states and 376 transitions. Second operand has 49 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 49 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:01:26,814 INFO L93 Difference]: Finished difference Result 676 states and 802 transitions. [2022-11-21 17:01:26,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-21 17:01:26,815 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 49 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-21 17:01:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:01:26,818 INFO L225 Difference]: With dead ends: 676 [2022-11-21 17:01:26,818 INFO L226 Difference]: Without dead ends: 676 [2022-11-21 17:01:26,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=865, Invalid=5409, Unknown=50, NotChecked=156, Total=6480 [2022-11-21 17:01:26,820 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 925 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 133 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:01:26,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1736 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2527 Invalid, 12 Unknown, 220 Unchecked, 3.4s Time] [2022-11-21 17:01:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-21 17:01:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 356. [2022-11-21 17:01:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 343 states have (on average 1.2332361516034986) internal successors, (423), 355 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2022-11-21 17:01:26,832 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 45 [2022-11-21 17:01:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:01:26,833 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2022-11-21 17:01:26,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 49 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2022-11-21 17:01:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:01:26,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:01:26,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:01:26,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-21 17:01:27,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 17:01:27,041 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:01:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:01:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1453916065, now seen corresponding path program 1 times [2022-11-21 17:01:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:01:27,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180346996] [2022-11-21 17:01:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:01:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:01:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180346996] [2022-11-21 17:01:28,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180346996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:01:28,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351173052] [2022-11-21 17:01:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:28,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:01:28,090 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:01:28,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 17:01:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:28,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 17:01:28,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:01:28,443 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:01:28,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:01:28,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:28,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:28,780 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:01:28,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-21 17:01:28,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:28,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:28,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:01:28,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-21 17:01:28,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:28,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:28,971 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-11-21 17:01:28,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 17:01:29,071 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-21 17:01:29,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-11-21 17:01:29,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:29,479 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:01:29,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2022-11-21 17:01:29,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-21 17:01:29,826 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 17:01:29,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2022-11-21 17:01:29,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:01:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:29,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:01:30,044 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-21 17:01:30,074 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-21 17:01:30,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:30,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-11-21 17:01:30,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:30,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-21 17:01:31,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:01:31,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 85 [2022-11-21 17:01:31,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 64 [2022-11-21 17:01:31,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-21 17:01:31,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-21 17:01:31,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:31,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:01:31,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:01:31,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-21 17:01:31,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:31,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:31,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:01:31,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:01:32,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:32,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-21 17:01:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 17:01:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351173052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:01:34,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:01:34,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 47 [2022-11-21 17:01:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556495123] [2022-11-21 17:01:34,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:01:34,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-21 17:01:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:01:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-21 17:01:34,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1814, Unknown=31, NotChecked=178, Total=2256 [2022-11-21 17:01:34,329 INFO L87 Difference]: Start difference. First operand 356 states and 423 transitions. Second operand has 48 states, 47 states have (on average 2.723404255319149) internal successors, (128), 48 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:01:40,231 INFO L93 Difference]: Finished difference Result 469 states and 548 transitions. [2022-11-21 17:01:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-21 17:01:40,232 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.723404255319149) internal successors, (128), 48 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-21 17:01:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:01:40,233 INFO L225 Difference]: With dead ends: 469 [2022-11-21 17:01:40,233 INFO L226 Difference]: Without dead ends: 469 [2022-11-21 17:01:40,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=728, Invalid=4354, Unknown=38, NotChecked=282, Total=5402 [2022-11-21 17:01:40,235 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 948 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 120 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:01:40,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1499 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2276 Invalid, 8 Unknown, 406 Unchecked, 3.1s Time] [2022-11-21 17:01:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-11-21 17:01:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 313. [2022-11-21 17:01:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 300 states have (on average 1.23) internal successors, (369), 312 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 369 transitions. [2022-11-21 17:01:40,243 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 369 transitions. Word has length 45 [2022-11-21 17:01:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:01:40,243 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 369 transitions. [2022-11-21 17:01:40,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.723404255319149) internal successors, (128), 48 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 369 transitions. [2022-11-21 17:01:40,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:01:40,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:01:40,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:01:40,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 17:01:40,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:40,451 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:01:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:01:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -63394326, now seen corresponding path program 1 times [2022-11-21 17:01:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:01:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394512036] [2022-11-21 17:01:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:01:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:40,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:01:40,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394512036] [2022-11-21 17:01:40,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394512036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:01:40,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170126204] [2022-11-21 17:01:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:01:40,964 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:01:40,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 17:01:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:41,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-21 17:01:41,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:01:41,310 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:01:41,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:01:41,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:41,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:41,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 17:01:41,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:01:41,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:41,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-11-21 17:01:42,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-21 17:01:42,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:42,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-21 17:01:42,368 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 14 [2022-11-21 17:01:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:42,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:01:42,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:42,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-21 17:01:42,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:42,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2022-11-21 17:01:43,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:43,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 101 [2022-11-21 17:01:45,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:45,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 17:01:45,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:45,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:01:45,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:01:46,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:46,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 78 [2022-11-21 17:01:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:46,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170126204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:01:46,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:01:46,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 23] total 51 [2022-11-21 17:01:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139390269] [2022-11-21 17:01:46,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:01:46,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-21 17:01:46,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:01:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-21 17:01:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2411, Unknown=36, NotChecked=0, Total=2652 [2022-11-21 17:01:46,349 INFO L87 Difference]: Start difference. First operand 313 states and 369 transitions. Second operand has 52 states, 51 states have (on average 2.5294117647058822) internal successors, (129), 52 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:01:52,416 INFO L93 Difference]: Finished difference Result 388 states and 444 transitions. [2022-11-21 17:01:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-21 17:01:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.5294117647058822) internal successors, (129), 52 states have internal predecessors, (129), 0 states have call successors, (0), 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 [2022-11-21 17:01:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:01:52,419 INFO L225 Difference]: With dead ends: 388 [2022-11-21 17:01:52,419 INFO L226 Difference]: Without dead ends: 388 [2022-11-21 17:01:52,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1361, Invalid=6788, Unknown=41, NotChecked=0, Total=8190 [2022-11-21 17:01:52,423 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 807 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:01:52,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1107 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-21 17:01:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-11-21 17:01:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 321. [2022-11-21 17:01:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 320 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 378 transitions. [2022-11-21 17:01:52,433 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 378 transitions. Word has length 46 [2022-11-21 17:01:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:01:52,434 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 378 transitions. [2022-11-21 17:01:52,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.5294117647058822) internal successors, (129), 52 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 378 transitions. [2022-11-21 17:01:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 17:01:52,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:01:52,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:01:52,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-21 17:01:52,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:52,643 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:01:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:01:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash -63394325, now seen corresponding path program 1 times [2022-11-21 17:01:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:01:52,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861200730] [2022-11-21 17:01:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:01:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:53,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:01:53,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861200730] [2022-11-21 17:01:53,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861200730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:01:53,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408755407] [2022-11-21 17:01:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:53,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:53,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:01:53,767 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:01:53,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 17:01:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:54,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-21 17:01:54,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:01:54,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:01:54,256 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:01:54,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:01:54,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:54,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:01:54,506 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:01:54,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-21 17:01:54,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-21 17:01:55,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:55,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-21 17:01:55,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:55,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-21 17:01:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:55,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:01:56,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:56,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 17:01:56,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:56,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-21 17:01:56,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:56,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-11-21 17:01:56,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-11-21 17:01:56,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:56,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:56,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-21 17:01:56,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:56,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:56,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2022-11-21 17:01:56,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:01:56,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2022-11-21 17:01:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 17:01:57,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408755407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:01:57,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:01:57,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 45 [2022-11-21 17:01:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751131775] [2022-11-21 17:01:57,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:01:57,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-21 17:01:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:01:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-21 17:01:57,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1817, Unknown=10, NotChecked=0, Total=2070 [2022-11-21 17:01:57,113 INFO L87 Difference]: Start difference. First operand 321 states and 378 transitions. Second operand has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:02:00,107 INFO L93 Difference]: Finished difference Result 366 states and 421 transitions. [2022-11-21 17:02:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-21 17:02:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 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 [2022-11-21 17:02:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:02:00,116 INFO L225 Difference]: With dead ends: 366 [2022-11-21 17:02:00,116 INFO L226 Difference]: Without dead ends: 366 [2022-11-21 17:02:00,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=920, Invalid=4326, Unknown=10, NotChecked=0, Total=5256 [2022-11-21 17:02:00,117 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1040 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:02:00,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 672 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-21 17:02:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-21 17:02:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 325. [2022-11-21 17:02:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.220447284345048) internal successors, (382), 324 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 382 transitions. [2022-11-21 17:02:00,124 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 382 transitions. Word has length 46 [2022-11-21 17:02:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:02:00,124 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 382 transitions. [2022-11-21 17:02:00,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 382 transitions. [2022-11-21 17:02:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 17:02:00,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:02:00,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:00,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-21 17:02:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:02:00,332 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:02:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1689205847, now seen corresponding path program 2 times [2022-11-21 17:02:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667804667] [2022-11-21 17:02:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:00,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:00,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667804667] [2022-11-21 17:02:00,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667804667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:02:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893137510] [2022-11-21 17:02:00,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:02:00,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:02:00,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:02:00,991 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:02:00,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-21 17:02:01,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:02:01,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:02:01,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-21 17:02:01,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:02:01,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:02:01,584 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:02:01,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:02:01,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:02:01,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:02:01,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:01,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-21 17:02:01,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:02:02,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:02:02,066 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:02:02,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:02,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:02,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:02:02,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-21 17:02:02,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 17:02:02,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:02:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:02,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:02:02,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-21 17:02:02,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1939 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1939) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-21 17:02:03,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1939 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1939) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)))) is different from false [2022-11-21 17:02:03,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:03,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-21 17:02:03,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:03,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2022-11-21 17:02:03,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2022-11-21 17:02:03,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-11-21 17:02:04,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:04,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-21 17:02:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-21 17:02:06,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893137510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:02:06,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:02:06,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2022-11-21 17:02:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647848795] [2022-11-21 17:02:06,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:02:06,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-21 17:02:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 17:02:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1483, Unknown=23, NotChecked=246, Total=1980 [2022-11-21 17:02:06,083 INFO L87 Difference]: Start difference. First operand 325 states and 382 transitions. Second operand has 45 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 45 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:09,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:14,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:16,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:02:21,369 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_46| Int) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1933 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_1933)) |v_ULTIMATE.start_main_~t~0#1.base_46| v_ArrVal_1939) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|) 0)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46| 1) |v_ULTIMATE.start_main_~t~0#1.base_45|))))) (forall ((v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1939 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1939) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)))) (= 2 (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_1940 (Array Int Int))) (< (select (select (store |c_#memory_int| .cse2 v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) is different from false [2022-11-21 17:02:24,014 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_46| Int) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1933 Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_1933)) |v_ULTIMATE.start_main_~t~0#1.base_46| v_ArrVal_1939) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46|) 0)) (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_46| 1) |v_ULTIMATE.start_main_~t~0#1.base_45|))))) (forall ((v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1933 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_1933)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1939) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) (= 2 (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1939 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1939) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) (forall ((v_ArrVal_1940 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2022-11-21 17:02:24,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1940 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_45| Int) (v_ArrVal_1939 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1939) |v_ULTIMATE.start_main_~t~0#1.base_45| v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_45|) 0)))) (forall ((v_ArrVal_1940 (Array Int Int))) (< (select (select (store |c_#memory_int| .cse0 v_ArrVal_1940) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))) is different from false [2022-11-21 17:02:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:02:24,894 INFO L93 Difference]: Finished difference Result 590 states and 683 transitions. [2022-11-21 17:02:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-21 17:02:24,894 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 45 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-21 17:02:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:02:24,898 INFO L225 Difference]: With dead ends: 590 [2022-11-21 17:02:24,898 INFO L226 Difference]: Without dead ends: 590 [2022-11-21 17:02:24,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1471, Invalid=7396, Unknown=87, NotChecked=1146, Total=10100 [2022-11-21 17:02:24,901 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 978 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 211 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:02:24,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 834 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1049 Invalid, 45 Unknown, 534 Unchecked, 8.0s Time] [2022-11-21 17:02:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-11-21 17:02:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 325. [2022-11-21 17:02:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.194888178913738) internal successors, (374), 324 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 374 transitions. [2022-11-21 17:02:24,910 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 374 transitions. Word has length 48 [2022-11-21 17:02:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:02:24,911 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 374 transitions. [2022-11-21 17:02:24,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.6222222222222222) internal successors, (118), 45 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 374 transitions. [2022-11-21 17:02:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-21 17:02:24,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:02:24,912 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:24,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-21 17:02:25,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:02:25,120 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:02:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1205371029, now seen corresponding path program 1 times [2022-11-21 17:02:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:25,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383810463] [2022-11-21 17:02:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383810463] [2022-11-21 17:02:25,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383810463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:02:25,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259086609] [2022-11-21 17:02:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:25,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:02:25,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:02:25,716 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:02:25,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-21 17:02:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:25,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-21 17:02:25,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:02:26,140 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:02:26,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 17:02:26,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:26,457 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:02:26,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-21 17:02:26,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:26,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 19 [2022-11-21 17:02:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 17:02:26,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:02:27,360 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|))) is different from false [2022-11-21 17:02:27,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-11-21 17:02:27,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:27,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 17:02:27,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:27,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:02:27,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:02:27,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:27,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2022-11-21 17:02:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-21 17:02:28,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259086609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:02:28,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:02:28,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2022-11-21 17:02:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534967831] [2022-11-21 17:02:28,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:02:28,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 17:02:28,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 17:02:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=879, Unknown=14, NotChecked=122, Total=1122 [2022-11-21 17:02:28,071 INFO L87 Difference]: Start difference. First operand 325 states and 374 transitions. Second operand has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 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) [2022-11-21 17:02:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:02:31,413 INFO L93 Difference]: Finished difference Result 362 states and 409 transitions. [2022-11-21 17:02:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:02:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 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 49 [2022-11-21 17:02:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:02:31,416 INFO L225 Difference]: With dead ends: 362 [2022-11-21 17:02:31,416 INFO L226 Difference]: Without dead ends: 362 [2022-11-21 17:02:31,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=586, Invalid=2830, Unknown=14, NotChecked=230, Total=3660 [2022-11-21 17:02:31,418 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 668 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:02:31,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 867 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1166 Invalid, 0 Unknown, 254 Unchecked, 1.6s Time] [2022-11-21 17:02:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-21 17:02:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 323. [2022-11-21 17:02:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.1961414790996785) internal successors, (372), 322 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) [2022-11-21 17:02:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 372 transitions. [2022-11-21 17:02:31,426 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 372 transitions. Word has length 49 [2022-11-21 17:02:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:02:31,427 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 372 transitions. [2022-11-21 17:02:31,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 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) [2022-11-21 17:02:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 372 transitions. [2022-11-21 17:02:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:02:31,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:02:31,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:31,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-21 17:02:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-21 17:02:31,636 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:02:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:31,637 INFO L85 PathProgramCache]: Analyzing trace with hash 84710120, now seen corresponding path program 2 times [2022-11-21 17:02:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:31,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959160695] [2022-11-21 17:02:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959160695] [2022-11-21 17:02:33,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959160695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:02:33,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211191507] [2022-11-21 17:02:33,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:02:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:02:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:02:33,220 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:02:33,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-21 17:02:33,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:02:33,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:02:33,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-21 17:02:33,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:02:33,663 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:02:33,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:02:33,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:33,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:34,129 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:02:34,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 17:02:34,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:02:34,169 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:02:34,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 17:02:34,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:02:34,346 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:02:34,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 17:02:34,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:02:34,385 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:02:34,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 17:02:34,545 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 17:02:34,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 17:02:34,699 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 17:02:34,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-21 17:02:34,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:02:34,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-21 17:02:35,157 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:02:35,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 99 [2022-11-21 17:02:35,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:02:35,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 103 [2022-11-21 17:02:35,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-21 17:02:35,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:35,512 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:02:35,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-11-21 17:02:35,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-21 17:02:35,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:02:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:35,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:02:35,819 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2139) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2022-11-21 17:02:35,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2139) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2022-11-21 17:02:35,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (= 2 (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_2139) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2138) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-11-21 17:02:35,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2137 (Array Int Int)) (v_ArrVal_2134 Int) (v_ArrVal_2140 (Array Int Int))) (= 2 (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_2134)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2139) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2137) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-11-21 17:02:36,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:36,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-11-21 17:02:36,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:36,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-11-21 17:02:36,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:36,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2022-11-21 17:02:36,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2022-11-21 17:02:36,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-21 17:02:37,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:37,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 109 [2022-11-21 17:02:37,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:37,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 99 [2022-11-21 17:02:37,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:37,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 146 [2022-11-21 17:02:37,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2022-11-21 17:02:37,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-21 17:02:37,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:37,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 429 treesize of output 410 [2022-11-21 17:02:37,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:37,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 394 treesize of output 335 [2022-11-21 17:02:37,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 310 [2022-11-21 17:02:37,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 294 [2022-11-21 17:02:37,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:37,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 267 [2022-11-21 17:02:40,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:40,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 255 [2022-11-21 17:02:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-21 17:02:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211191507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:02:41,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:02:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 49 [2022-11-21 17:02:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697277176] [2022-11-21 17:02:41,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:02:41,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 17:02:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:41,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 17:02:41,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1749, Unknown=4, NotChecked=356, Total=2352 [2022-11-21 17:02:41,221 INFO L87 Difference]: Start difference. First operand 323 states and 372 transitions. Second operand has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:02:47,167 INFO L93 Difference]: Finished difference Result 526 states and 597 transitions. [2022-11-21 17:02:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 17:02:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 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 51 [2022-11-21 17:02:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:02:47,171 INFO L225 Difference]: With dead ends: 526 [2022-11-21 17:02:47,171 INFO L226 Difference]: Without dead ends: 526 [2022-11-21 17:02:47,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=556, Invalid=3484, Unknown=8, NotChecked=508, Total=4556 [2022-11-21 17:02:47,173 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 920 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 85 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 805 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:02:47,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1302 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1786 Invalid, 23 Unknown, 805 Unchecked, 3.6s Time] [2022-11-21 17:02:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-21 17:02:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 359. [2022-11-21 17:02:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 347 states have (on average 1.1844380403458212) internal successors, (411), 358 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 411 transitions. [2022-11-21 17:02:47,183 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 411 transitions. Word has length 51 [2022-11-21 17:02:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:02:47,183 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 411 transitions. [2022-11-21 17:02:47,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 411 transitions. [2022-11-21 17:02:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:02:47,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:02:47,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:47,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-21 17:02:47,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-21 17:02:47,393 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:02:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash 84402290, now seen corresponding path program 1 times [2022-11-21 17:02:47,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:47,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177351137] [2022-11-21 17:02:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:47,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177351137] [2022-11-21 17:02:49,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177351137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:02:49,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851513800] [2022-11-21 17:02:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:02:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:02:49,716 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:02:49,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-21 17:02:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:49,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-21 17:02:49,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:02:50,126 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:02:50,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:02:50,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:50,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:50,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:50,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:50,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:02:50,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:50,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:02:50,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:02:50,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:50,772 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:02:50,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:50,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 17:02:50,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:02:50,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:02:50,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 17:02:51,149 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:02:51,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 71 [2022-11-21 17:02:51,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 17:02:51,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-21 17:02:51,690 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:02:51,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-11-21 17:02:51,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:02:51,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-11-21 17:02:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:02:51,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:02:52,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2269))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= 2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2267) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) 0))))) is different from false [2022-11-21 17:02:52,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (let ((.cse1 (store |c_#memory_int| .cse2 v_ArrVal_2269))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (not (= 2 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2268) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2267) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 4))) 0)))))) is different from false [2022-11-21 17:02:53,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:53,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-11-21 17:02:53,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:53,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 109 [2022-11-21 17:02:53,806 INFO L321 Elim1Store]: treesize reduction 4, result has 97.4 percent of original size [2022-11-21 17:02:53,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 289 [2022-11-21 17:02:53,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:53,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 130 [2022-11-21 17:02:54,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2022-11-21 17:02:54,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:02:58,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:02:58,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-21 17:02:58,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:58,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:02:58,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:02:58,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:58,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-21 17:02:58,622 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-11-21 17:02:58,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-21 17:02:58,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:58,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-21 17:02:58,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-11-21 17:02:58,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:02:58,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2022-11-21 17:02:58,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:58,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:02:58,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:58,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-21 17:02:58,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:58,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2022-11-21 17:02:59,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:02:59,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 72 [2022-11-21 17:02:59,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:59,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 81 [2022-11-21 17:02:59,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-21 17:02:59,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2022-11-21 17:02:59,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:02:59,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:59,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-21 17:02:59,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:59,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-21 17:02:59,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-11-21 17:02:59,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-21 17:02:59,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:02:59,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2022-11-21 17:02:59,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:59,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:02:59,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:02:59,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:02:59,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2022-11-21 17:02:59,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:59,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2022-11-21 17:03:00,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:00,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 222 [2022-11-21 17:03:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 17:03:05,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851513800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:03:05,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:03:05,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 27] total 60 [2022-11-21 17:03:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76344151] [2022-11-21 17:03:05,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:03:05,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-21 17:03:05,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:03:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-21 17:03:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2997, Unknown=24, NotChecked=226, Total=3540 [2022-11-21 17:03:05,843 INFO L87 Difference]: Start difference. First operand 359 states and 411 transitions. Second operand has 60 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 60 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:03:34,037 INFO L93 Difference]: Finished difference Result 555 states and 629 transitions. [2022-11-21 17:03:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-21 17:03:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 60 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-21 17:03:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:03:34,040 INFO L225 Difference]: With dead ends: 555 [2022-11-21 17:03:34,040 INFO L226 Difference]: Without dead ends: 555 [2022-11-21 17:03:34,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=938, Invalid=7577, Unknown=49, NotChecked=366, Total=8930 [2022-11-21 17:03:34,042 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 555 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 3380 mSolverCounterSat, 114 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3380 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:03:34,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 2032 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3380 Invalid, 46 Unknown, 487 Unchecked, 9.7s Time] [2022-11-21 17:03:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-11-21 17:03:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 361. [2022-11-21 17:03:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 349 states have (on average 1.183381088825215) internal successors, (413), 360 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 413 transitions. [2022-11-21 17:03:34,051 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 413 transitions. Word has length 51 [2022-11-21 17:03:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:03:34,051 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 413 transitions. [2022-11-21 17:03:34,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.1333333333333333) internal successors, (128), 60 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 413 transitions. [2022-11-21 17:03:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:03:34,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:03:34,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:03:34,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-21 17:03:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-21 17:03:34,260 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:03:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -583491704, now seen corresponding path program 1 times [2022-11-21 17:03:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:34,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753460832] [2022-11-21 17:03:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:03:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:03:36,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753460832] [2022-11-21 17:03:36,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753460832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:03:36,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785578803] [2022-11-21 17:03:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:36,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:03:36,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:03:36,410 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:03:36,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-21 17:03:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:36,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-21 17:03:36,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:03:36,812 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:03:36,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:03:36,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:03:36,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:03:37,202 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:03:37,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-21 17:03:37,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:03:37,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:03:37,246 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:03:37,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-21 17:03:37,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:03:37,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-21 17:03:37,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:03:37,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:03:37,615 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:03:37,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:03:37,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-21 17:03:37,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:03:37,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 17:03:38,065 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:03:38,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 72 [2022-11-21 17:03:38,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-21 17:03:38,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-21 17:03:38,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:03:38,363 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:03:38,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 27 [2022-11-21 17:03:38,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-21 17:03:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:03:38,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:03:38,678 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2398) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0))) is different from false [2022-11-21 17:03:38,704 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2398) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0))) is different from false [2022-11-21 17:03:38,715 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2398 (Array Int Int)) (v_ArrVal_2397 (Array Int Int)) (v_ArrVal_2396 (Array Int Int))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_2398) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2397) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2396) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) 0))) is different from false [2022-11-21 17:03:38,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:38,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-21 17:03:39,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:39,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2022-11-21 17:03:39,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:39,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 125 [2022-11-21 17:03:39,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2022-11-21 17:03:39,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-21 17:03:40,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:03:40,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2022-11-21 17:03:40,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-11-21 17:03:40,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2022-11-21 17:03:40,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-21 17:03:40,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:03:40,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-21 17:03:40,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-11-21 17:03:40,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-21 17:03:40,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:03:40,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:40,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:03:40,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:03:41,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:03:41,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-21 17:03:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-21 17:03:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785578803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:03:44,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:03:44,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 49 [2022-11-21 17:03:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098496074] [2022-11-21 17:03:44,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:03:44,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 17:03:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:03:44,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 17:03:44,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1862, Unknown=14, NotChecked=270, Total=2352 [2022-11-21 17:03:44,724 INFO L87 Difference]: Start difference. First operand 361 states and 413 transitions. Second operand has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:52,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:03:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:03:58,787 INFO L93 Difference]: Finished difference Result 476 states and 545 transitions. [2022-11-21 17:03:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 17:03:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 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 51 [2022-11-21 17:03:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:03:58,789 INFO L225 Difference]: With dead ends: 476 [2022-11-21 17:03:58,789 INFO L226 Difference]: Without dead ends: 476 [2022-11-21 17:03:58,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=395, Invalid=2901, Unknown=22, NotChecked=342, Total=3660 [2022-11-21 17:03:58,791 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 468 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 64 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 607 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:03:58,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1626 Invalid, 3221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2522 Invalid, 28 Unknown, 607 Unchecked, 8.6s Time] [2022-11-21 17:03:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-21 17:03:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 359. [2022-11-21 17:03:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 347 states have (on average 1.1786743515850144) internal successors, (409), 358 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 409 transitions. [2022-11-21 17:03:58,799 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 409 transitions. Word has length 51 [2022-11-21 17:03:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:03:58,799 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 409 transitions. [2022-11-21 17:03:58,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:03:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 409 transitions. [2022-11-21 17:03:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 17:03:58,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:03:58,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:03:58,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-21 17:03:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-21 17:03:59,008 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:03:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash -583799534, now seen corresponding path program 1 times [2022-11-21 17:03:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:59,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180502604] [2022-11-21 17:03:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:04:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:04:00,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:04:00,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180502604] [2022-11-21 17:04:00,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180502604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:04:00,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664456369] [2022-11-21 17:04:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:04:00,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:04:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:04:00,485 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:04:00,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-21 17:04:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:04:00,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-21 17:04:00,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:04:00,854 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:04:00,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 17:04:00,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:04:00,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:04:01,337 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:04:01,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 17:04:01,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:04:01,378 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:04:01,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 17:04:01,550 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 17:04:01,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-21 17:04:01,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:04:01,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:04:01,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-21 17:04:01,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:04:01,766 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 17:04:01,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-21 17:04:01,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:04:01,931 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 17:04:01,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-21 17:04:01,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-21 17:04:02,397 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:04:02,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 114 [2022-11-21 17:04:02,431 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-21 17:04:02,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 116 [2022-11-21 17:04:02,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-21 17:04:02,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:04:02,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:04:02,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 43 [2022-11-21 17:04:02,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2022-11-21 17:04:02,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 17:04:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:04:02,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:04:03,436 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2524 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_2526) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2525) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2524) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2022-11-21 17:04:03,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2526 (Array Int Int)) (v_ArrVal_2525 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (v_ArrVal_2520 Int)) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_2520)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2526) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2525) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2524) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2022-11-21 17:04:03,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:03,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2022-11-21 17:04:03,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:03,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2022-11-21 17:04:03,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:03,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 131 [2022-11-21 17:04:03,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:03,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 97 [2022-11-21 17:04:03,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2022-11-21 17:04:03,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 17:04:03,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-21 17:04:03,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-21 17:04:04,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 17:04:04,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 157 [2022-11-21 17:04:04,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-11-21 17:04:04,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2022-11-21 17:04:04,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-21 17:04:04,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:04:04,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 17:04:04,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-11-21 17:04:04,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-21 17:04:04,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:04:04,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:04,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-11-21 17:04:05,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:05,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-11-21 17:04:05,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:05,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-11-21 17:04:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-21 17:04:06,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664456369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:04:06,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:04:06,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 45 [2022-11-21 17:04:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084866578] [2022-11-21 17:04:06,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:04:06,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-21 17:04:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:04:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-21 17:04:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1588, Unknown=32, NotChecked=166, Total=1980 [2022-11-21 17:04:06,853 INFO L87 Difference]: Start difference. First operand 359 states and 409 transitions. Second operand has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:04:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:04:13,846 INFO L93 Difference]: Finished difference Result 514 states and 583 transitions. [2022-11-21 17:04:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 17:04:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 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 51 [2022-11-21 17:04:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:04:13,849 INFO L225 Difference]: With dead ends: 514 [2022-11-21 17:04:13,849 INFO L226 Difference]: Without dead ends: 514 [2022-11-21 17:04:13,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=441, Invalid=3067, Unknown=40, NotChecked=234, Total=3782 [2022-11-21 17:04:13,850 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 482 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 43 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:04:13,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1724 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2601 Invalid, 21 Unknown, 358 Unchecked, 4.9s Time] [2022-11-21 17:04:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-11-21 17:04:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 357. [2022-11-21 17:04:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 345 states have (on average 1.1797101449275362) internal successors, (407), 356 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:04:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 407 transitions. [2022-11-21 17:04:13,857 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 407 transitions. Word has length 51 [2022-11-21 17:04:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:04:13,857 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 407 transitions. [2022-11-21 17:04:13,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:04:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 407 transitions. [2022-11-21 17:04:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-21 17:04:13,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:04:13,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:04:13,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-21 17:04:14,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:04:14,071 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:04:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:04:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1013030303, now seen corresponding path program 1 times [2022-11-21 17:04:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:04:14,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500334623] [2022-11-21 17:04:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:04:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:04:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:04:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:04:15,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:04:15,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500334623] [2022-11-21 17:04:15,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500334623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:04:15,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134208580] [2022-11-21 17:04:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:04:15,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:04:15,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:04:15,014 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:04:15,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-21 17:04:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:04:15,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-21 17:04:15,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:04:15,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:04:16,353 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:04:16,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-11-21 17:04:17,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:17,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2022-11-21 17:04:17,592 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~p~0#1.base_195| Int) (v_ArrVal_2600 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_195| 1))) (and (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2600) |v_ULTIMATE.start_main_~p~0#1.base_195| 0)) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_195|) 0)))) is different from true [2022-11-21 17:04:17,648 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~p~0#1.base| Int) (|v_ULTIMATE.start_main_~p~0#1.base_195| Int) (v_ArrVal_2600 Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_195| 1))) (and (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0) (= |c_#valid| (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2600) |v_ULTIMATE.start_main_~p~0#1.base_195| 0) |ULTIMATE.start_main_~p~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_195|) 0)))) is different from true [2022-11-21 17:04:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-21 17:04:17,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:04:18,153 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2603 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2603) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-21 17:04:18,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2603 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2603) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-21 17:04:18,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2603 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_2603) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-11-21 17:04:18,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:18,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-21 17:04:18,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:04:18,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2022-11-21 17:04:18,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-11-21 17:06:08,725 WARN L233 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 40 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:06:35,181 WARN L233 SmtUtils]: Spent 26.17s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:07:01,516 WARN L233 SmtUtils]: Spent 26.16s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:07:38,197 WARN L233 SmtUtils]: Spent 36.24s on a formula simplification. DAG size of input: 53 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:07:46,597 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:07:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-21 17:07:46,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134208580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:07:46,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:07:46,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 47 [2022-11-21 17:07:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459036055] [2022-11-21 17:07:46,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:07:46,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-21 17:07:46,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-21 17:07:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1625, Unknown=11, NotChecked=430, Total=2256 [2022-11-21 17:07:46,690 INFO L87 Difference]: Start difference. First operand 357 states and 407 transitions. Second operand has 48 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:08:13,330 WARN L233 SmtUtils]: Spent 22.24s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:08:19,827 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:08:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:08:19,878 INFO L93 Difference]: Finished difference Result 403 states and 452 transitions. [2022-11-21 17:08:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 17:08:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-21 17:08:19,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:08:19,880 INFO L225 Difference]: With dead ends: 403 [2022-11-21 17:08:19,880 INFO L226 Difference]: Without dead ends: 398 [2022-11-21 17:08:19,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 240.4s TimeCoverageRelationStatistics Valid=375, Invalid=2940, Unknown=11, NotChecked=580, Total=3906 [2022-11-21 17:08:19,881 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 363 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:08:19,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 840 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1098 Invalid, 0 Unknown, 573 Unchecked, 2.3s Time] [2022-11-21 17:08:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-21 17:08:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 353. [2022-11-21 17:08:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 352 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:08:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 402 transitions. [2022-11-21 17:08:19,889 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 402 transitions. Word has length 52 [2022-11-21 17:08:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:08:19,890 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 402 transitions. [2022-11-21 17:08:19,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.106382978723404) internal successors, (146), 48 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:08:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 402 transitions. [2022-11-21 17:08:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 17:08:19,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:08:19,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:08:19,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-21 17:08:20,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-21 17:08:20,099 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-11-21 17:08:20,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:08:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash 22625035, now seen corresponding path program 2 times [2022-11-21 17:08:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:08:20,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432948148] [2022-11-21 17:08:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:08:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:08:20,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:08:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:08:20,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:08:20,175 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:08:20,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 45 remaining) [2022-11-21 17:08:20,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2022-11-21 17:08:20,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2022-11-21 17:08:20,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2022-11-21 17:08:20,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2022-11-21 17:08:20,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2022-11-21 17:08:20,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2022-11-21 17:08:20,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2022-11-21 17:08:20,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2022-11-21 17:08:20,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2022-11-21 17:08:20,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2022-11-21 17:08:20,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2022-11-21 17:08:20,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2022-11-21 17:08:20,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2022-11-21 17:08:20,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2022-11-21 17:08:20,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2022-11-21 17:08:20,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2022-11-21 17:08:20,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2022-11-21 17:08:20,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2022-11-21 17:08:20,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2022-11-21 17:08:20,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2022-11-21 17:08:20,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2022-11-21 17:08:20,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2022-11-21 17:08:20,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2022-11-21 17:08:20,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2022-11-21 17:08:20,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2022-11-21 17:08:20,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2022-11-21 17:08:20,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2022-11-21 17:08:20,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2022-11-21 17:08:20,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2022-11-21 17:08:20,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2022-11-21 17:08:20,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (13 of 45 remaining) [2022-11-21 17:08:20,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (12 of 45 remaining) [2022-11-21 17:08:20,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (11 of 45 remaining) [2022-11-21 17:08:20,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2022-11-21 17:08:20,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2022-11-21 17:08:20,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2022-11-21 17:08:20,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (7 of 45 remaining) [2022-11-21 17:08:20,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (6 of 45 remaining) [2022-11-21 17:08:20,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (5 of 45 remaining) [2022-11-21 17:08:20,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (4 of 45 remaining) [2022-11-21 17:08:20,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (3 of 45 remaining) [2022-11-21 17:08:20,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2022-11-21 17:08:20,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (1 of 45 remaining) [2022-11-21 17:08:20,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (0 of 45 remaining) [2022-11-21 17:08:20,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-21 17:08:20,212 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:08:20,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:08:20,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:08:20 BoogieIcfgContainer [2022-11-21 17:08:20,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:08:20,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:08:20,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:08:20,309 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:08:20,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:59:36" (3/4) ... [2022-11-21 17:08:20,313 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 17:08:20,385 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:08:20,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:08:20,386 INFO L158 Benchmark]: Toolchain (without parser) took 525831.53ms. Allocated memory was 132.1MB in the beginning and 243.3MB in the end (delta: 111.1MB). Free memory was 86.0MB in the beginning and 190.9MB in the end (delta: -104.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,386 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 132.1MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:08:20,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.99ms. Allocated memory is still 132.1MB. Free memory was 86.0MB in the beginning and 69.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.97ms. Allocated memory is still 132.1MB. Free memory was 69.2MB in the beginning and 67.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,387 INFO L158 Benchmark]: Boogie Preprocessor took 36.62ms. Allocated memory is still 132.1MB. Free memory was 67.1MB in the beginning and 65.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,387 INFO L158 Benchmark]: RCFGBuilder took 857.86ms. Allocated memory was 132.1MB in the beginning and 167.8MB in the end (delta: 35.7MB). Free memory was 65.5MB in the beginning and 127.8MB in the end (delta: -62.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,387 INFO L158 Benchmark]: TraceAbstraction took 524300.04ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 126.7MB in the beginning and 194.0MB in the end (delta: -67.3MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,388 INFO L158 Benchmark]: Witness Printer took 77.66ms. Allocated memory is still 243.3MB. Free memory was 194.0MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 17:08:20,389 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.37ms. Allocated memory is still 132.1MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.99ms. Allocated memory is still 132.1MB. Free memory was 86.0MB in the beginning and 69.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.97ms. Allocated memory is still 132.1MB. Free memory was 69.2MB in the beginning and 67.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.62ms. Allocated memory is still 132.1MB. Free memory was 67.1MB in the beginning and 65.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 857.86ms. Allocated memory was 132.1MB in the beginning and 167.8MB in the end (delta: 35.7MB). Free memory was 65.5MB in the beginning and 127.8MB in the end (delta: -62.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 524300.04ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 126.7MB in the beginning and 194.0MB in the end (delta: -67.3MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. * Witness Printer took 77.66ms. Allocated memory is still 243.3MB. Free memory was 194.0MB in the beginning and 190.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L567] List p, a, t; [L568] a = (List) malloc(sizeof(struct node)) [L569] COND FALSE !(a == 0) VAL [a={6:0}] [L570] a->n = 0 VAL [a={6:0}] [L571] p = a [L572] int i = 0; VAL [a={6:0}, i=0, p={6:0}] [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, a={6:0}, i=0, i < 20 && __VERIFIER_nondet_int()=1, p={6:0}] [L573] COND TRUE i < 20 && __VERIFIER_nondet_int() [L574] i++ [L575] p->flag = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, p={6:0}] [L576] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0] [L576] COND FALSE !(p->flag) [L579] p->h = 2 VAL [a={6:0}, i=1, p={6:0}] [L581] t = (List) malloc(sizeof(struct node)) [L582] COND FALSE !(t == 0) VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L583] p->n = t VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L584] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={5:0}, t={5:0}] [L584] p = p->n [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, i < 20 && __VERIFIER_nondet_int()=0, p={5:0}, t={5:0}] [L573] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L586] p->h = 3 VAL [a={6:0}, i=1, p={5:0}, t={5:0}] [L587] p = a VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L588] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={5:0}] [L588] COND TRUE p->h != 3 [L589] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0, t={5:0}] [L589] COND FALSE !(p->flag) [L593] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={5:0}] [L593] COND FALSE !(p->h != 2) [L596] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={5:0}, t={5:0}] [L596] p = p->n [L597] i++ VAL [a={6:0}, i=2, p={5:0}, t={5:0}] [L588] EXPR p->h VAL [a={6:0}, i=2, p={5:0}, p->h=3, t={5:0}] [L588] COND FALSE !(p->h != 3) [L599] EXPR p->h VAL [a={6:0}, i=2, p={5:0}, p->h=3, t={5:0}] [L599] COND FALSE !(p->h != 3 || i > 20) [L601] p = a VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L602] COND FALSE !(p == 0) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L605] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L605] COND FALSE !(p->n == 0) [L610] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={5:0}, t={5:0}] [L610] EXPR p->n VAL [a={6:0}, i=2, p={5:0}, p->n={49:59}, t={5:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={5:0}, p->n={49:59}, t={5:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={5:0}, t={49:59}] [L612] free(p) VAL [a={6:0}, i=2, p={5:0}, t={49:59}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={49:59}, t={49:59}] [L610] p->n - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 566]: 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 2 procedures, 105 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 524.1s, OverallIterations: 39, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 184.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 223 mSolverCounterUnknown, 17310 SdHoareTripleChecker+Valid, 74.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17310 mSDsluCounter, 27560 SdHoareTripleChecker+Invalid, 69.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7853 IncrementalHoareTripleChecker+Unchecked, 25073 mSDsCounter, 2284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37096 IncrementalHoareTripleChecker+Invalid, 47456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2284 mSolverCounterUnsat, 2487 mSDtfsCounter, 37096 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3016 GetRequests, 1478 SyntacticMatches, 76 SemanticMatches, 1462 ConstructedPredicates, 50 IntricatePredicates, 3 DeprecatedPredicates, 24454 ImplicationChecksByTransitivity, 364.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=35, InterpolantAutomatonStates: 773, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 3495 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 327.1s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2364 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 3247 ConstructedInterpolants, 595 QuantifiedInterpolants, 69336 SizeOfPredicates, 396 NumberOfNonLiveVariables, 6767 ConjunctsInSsa, 1157 ConjunctsInUnsatCore, 89 InterpolantComputations, 13 PerfectInterpolantSequences, 49/853 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: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 17:08:20,634 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-21 17:08:20,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb8baeea-0f69-4917-a8c3-a4d1cd262c5a/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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)