./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc --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 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:07:34,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:34,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:34,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:34,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:34,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:34,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:34,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:34,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:34,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:34,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:34,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:34,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:34,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:34,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:34,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:34,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:34,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:34,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:34,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:34,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:34,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:34,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:34,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:34,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:34,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:34,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:34,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:34,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:34,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:34,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:34,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:34,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:34,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:34,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:34,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:34,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:34,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:34,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:34,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:34,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:34,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 21:07:34,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:34,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:34,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:34,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:34,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:34,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:34,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:34,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:34,277 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:34,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:34,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:34,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:07:34,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:34,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:34,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:34,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 21:07:34,280 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 21:07:34,280 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 21:07:34,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:34,280 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:07:34,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:34,281 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:34,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:34,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:34,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:34,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:34,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:34,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:34,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:34,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:34,283 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_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/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_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2022-11-02 21:07:34,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:34,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:34,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:34,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:34,637 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:34,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-11-02 21:07:34,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/data/89ff5c75c/e191da23c9ea481da77343811d3029c0/FLAG0d2ffc6f0 [2022-11-02 21:07:35,312 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:35,312 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2022-11-02 21:07:35,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/data/89ff5c75c/e191da23c9ea481da77343811d3029c0/FLAG0d2ffc6f0 [2022-11-02 21:07:35,589 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/data/89ff5c75c/e191da23c9ea481da77343811d3029c0 [2022-11-02 21:07:35,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:35,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:35,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:35,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:35,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:35,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:35" (1/1) ... [2022-11-02 21:07:35,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b52243f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:35, skipping insertion in model container [2022-11-02 21:07:35,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:35" (1/1) ... [2022-11-02 21:07:35,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:35,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:35,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-11-02 21:07:35,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-11-02 21:07:35,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-11-02 21:07:35,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-11-02 21:07:35,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-11-02 21:07:35,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-11-02 21:07:35,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-11-02 21:07:36,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:36,021 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:36,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22673,22686] [2022-11-02 21:07:36,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22743,22756] [2022-11-02 21:07:36,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22807,22820] [2022-11-02 21:07:36,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22902,22915] [2022-11-02 21:07:36,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[22974,22987] [2022-11-02 21:07:36,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23113,23126] [2022-11-02 21:07:36,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i[23187,23200] [2022-11-02 21:07:36,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:36,101 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:36,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36 WrapperNode [2022-11-02 21:07:36,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:36,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:36,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:36,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:36,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,173 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2022-11-02 21:07:36,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:36,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:36,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:36,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:36,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,209 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:36,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:36,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:36,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:36,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (1/1) ... [2022-11-02 21:07:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:36,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:36,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:36,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:36,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:07:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:07:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:07:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:07:36,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:07:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:07:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:36,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:36,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:36,520 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:36,521 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:37,116 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:37,126 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:37,126 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-02 21:07:37,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:37 BoogieIcfgContainer [2022-11-02 21:07:37,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:37,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:37,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:37,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:37,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:35" (1/3) ... [2022-11-02 21:07:37,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f7f07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:37, skipping insertion in model container [2022-11-02 21:07:37,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:36" (2/3) ... [2022-11-02 21:07:37,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f7f07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:37, skipping insertion in model container [2022-11-02 21:07:37,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:37" (3/3) ... [2022-11-02 21:07:37,139 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2022-11-02 21:07:37,159 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:37,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-11-02 21:07:37,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:37,216 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;@4b593634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:37,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-02 21:07:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 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-02 21:07:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:07:37,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:37,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:07:37,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 21:07:37,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147449647] [2022-11-02 21:07:37,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,445 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-02 21:07:37,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147449647] [2022-11-02 21:07:37,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147449647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905700843] [2022-11-02 21:07:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:37,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:37,486 INFO L87 Difference]: Start difference. First operand has 171 states, 90 states have (on average 2.2222222222222223) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02 21:07:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:37,667 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2022-11-02 21:07:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 21:07:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:37,680 INFO L225 Difference]: With dead ends: 198 [2022-11-02 21:07:37,680 INFO L226 Difference]: Without dead ends: 196 [2022-11-02 21:07:37,682 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-02 21:07:37,685 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 151 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:37,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-02 21:07:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2022-11-02 21:07:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.913978494623656) internal successors, (178), 169 states have internal predecessors, (178), 0 states have call successors, (0), 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-02 21:07:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 178 transitions. [2022-11-02 21:07:37,728 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 178 transitions. Word has length 3 [2022-11-02 21:07:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:37,728 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 178 transitions. [2022-11-02 21:07:37,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02 21:07:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 178 transitions. [2022-11-02 21:07:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 21:07:37,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:37,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 21:07:37,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:37,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 21:07:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:37,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879910486] [2022-11-02 21:07:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:37,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:37,859 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-02 21:07:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:37,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879910486] [2022-11-02 21:07:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879910486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:37,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:37,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729486958] [2022-11-02 21:07:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:37,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:37,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:37,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:37,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:37,874 INFO L87 Difference]: Start difference. First operand 170 states and 178 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02 21:07:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:38,042 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-11-02 21:07:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:38,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 21:07:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:38,048 INFO L225 Difference]: With dead ends: 166 [2022-11-02 21:07:38,049 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 21:07:38,052 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-02 21:07:38,054 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:38,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 90 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 21:07:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-02 21:07:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 165 states have internal predecessors, (173), 0 states have call successors, (0), 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-02 21:07:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2022-11-02 21:07:38,079 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 3 [2022-11-02 21:07:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:38,080 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2022-11-02 21:07:38,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02 21:07:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-11-02 21:07:38,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:07:38,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:38,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:38,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:38,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-11-02 21:07:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:38,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400212139] [2022-11-02 21:07:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,195 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-02 21:07:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:38,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400212139] [2022-11-02 21:07:38,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400212139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:38,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:38,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297528884] [2022-11-02 21:07:38,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:38,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:38,198 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:38,356 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2022-11-02 21:07:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 21:07:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:38,358 INFO L225 Difference]: With dead ends: 162 [2022-11-02 21:07:38,358 INFO L226 Difference]: Without dead ends: 162 [2022-11-02 21:07:38,358 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-02 21:07:38,359 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:38,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 103 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-02 21:07:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-11-02 21:07:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 94 states have (on average 1.7872340425531914) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 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-02 21:07:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2022-11-02 21:07:38,367 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 7 [2022-11-02 21:07:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:38,368 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2022-11-02 21:07:38,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2022-11-02 21:07:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:07:38,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:38,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:38,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:38,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:38,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-11-02 21:07:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:38,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791429334] [2022-11-02 21:07:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,558 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-02 21:07:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791429334] [2022-11-02 21:07:38,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791429334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:38,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:38,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:38,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373578808] [2022-11-02 21:07:38,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:38,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:38,569 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:38,717 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2022-11-02 21:07:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:38,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 21:07:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:38,719 INFO L225 Difference]: With dead ends: 177 [2022-11-02 21:07:38,719 INFO L226 Difference]: Without dead ends: 177 [2022-11-02 21:07:38,720 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-02 21:07:38,721 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 134 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:38,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 112 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-02 21:07:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2022-11-02 21:07:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.702970297029703) internal successors, (172), 163 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 172 transitions. [2022-11-02 21:07:38,736 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 172 transitions. Word has length 7 [2022-11-02 21:07:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:38,736 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 172 transitions. [2022-11-02 21:07:38,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 172 transitions. [2022-11-02 21:07:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:07:38,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:38,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:38,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:38,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2022-11-02 21:07:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196199229] [2022-11-02 21:07:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:38,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:38,979 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-02 21:07:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196199229] [2022-11-02 21:07:38,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196199229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:38,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:38,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81458967] [2022-11-02 21:07:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:38,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:38,982 INFO L87 Difference]: Start difference. First operand 164 states and 172 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:39,175 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-11-02 21:07:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:39,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 21:07:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:39,180 INFO L225 Difference]: With dead ends: 164 [2022-11-02 21:07:39,180 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 21:07:39,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 21:07:39,184 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 217 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:39,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 89 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 21:07:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2022-11-02 21:07:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.5631067961165048) internal successors, (161), 150 states have internal predecessors, (161), 0 states have call successors, (0), 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-02 21:07:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2022-11-02 21:07:39,202 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 13 [2022-11-02 21:07:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:39,202 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2022-11-02 21:07:39,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2022-11-02 21:07:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:07:39,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:39,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:39,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:39,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2022-11-02 21:07:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:39,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149290737] [2022-11-02 21:07:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,478 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-02 21:07:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:39,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149290737] [2022-11-02 21:07:39,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149290737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:39,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:39,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:07:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877193837] [2022-11-02 21:07:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:39,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:39,481 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:39,732 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-11-02 21:07:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:39,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 21:07:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:39,733 INFO L225 Difference]: With dead ends: 193 [2022-11-02 21:07:39,734 INFO L226 Difference]: Without dead ends: 193 [2022-11-02 21:07:39,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 21:07:39,735 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 187 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:39,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 133 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:39,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-02 21:07:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2022-11-02 21:07:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 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-02 21:07:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-11-02 21:07:39,739 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 13 [2022-11-02 21:07:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:39,740 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-11-02 21:07:39,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-11-02 21:07:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 21:07:39,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:39,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:39,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2022-11-02 21:07:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:39,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4149599] [2022-11-02 21:07:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:39,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:39,821 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-02 21:07:39,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:39,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4149599] [2022-11-02 21:07:39,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4149599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:39,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:39,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697203587] [2022-11-02 21:07:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:39,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:39,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:39,824 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:40,067 INFO L93 Difference]: Finished difference Result 202 states and 212 transitions. [2022-11-02 21:07:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:40,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 21:07:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:40,070 INFO L225 Difference]: With dead ends: 202 [2022-11-02 21:07:40,070 INFO L226 Difference]: Without dead ends: 202 [2022-11-02 21:07:40,070 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-02 21:07:40,071 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 302 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:40,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 157 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-02 21:07:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2022-11-02 21:07:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 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-02 21:07:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2022-11-02 21:07:40,076 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 15 [2022-11-02 21:07:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:40,077 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2022-11-02 21:07:40,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2022-11-02 21:07:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:07:40,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:40,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:40,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:40,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2022-11-02 21:07:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:40,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738621489] [2022-11-02 21:07:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,208 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-02 21:07:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:40,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738621489] [2022-11-02 21:07:40,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738621489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:40,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651726189] [2022-11-02 21:07:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:40,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:40,211 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:40,400 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2022-11-02 21:07:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:40,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:07:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:40,402 INFO L225 Difference]: With dead ends: 161 [2022-11-02 21:07:40,402 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 21:07:40,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:40,403 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:40,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 352 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 21:07:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-11-02 21:07:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 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-02 21:07:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-11-02 21:07:40,408 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 16 [2022-11-02 21:07:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:40,409 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-11-02 21:07:40,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-11-02 21:07:40,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 21:07:40,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:40,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:40,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2022-11-02 21:07:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109612595] [2022-11-02 21:07:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:40,655 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-02 21:07:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109612595] [2022-11-02 21:07:40,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109612595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:40,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:40,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566844115] [2022-11-02 21:07:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:40,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:40,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:40,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:40,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:40,658 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:40,869 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-11-02 21:07:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:07:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 21:07:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:40,870 INFO L225 Difference]: With dead ends: 160 [2022-11-02 21:07:40,870 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 21:07:40,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:40,871 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:40,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 343 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 21:07:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 21:07:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 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-02 21:07:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-11-02 21:07:40,875 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 16 [2022-11-02 21:07:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:40,875 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-11-02 21:07:40,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-11-02 21:07:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 21:07:40,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:40,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:40,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:40,876 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2022-11-02 21:07:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:40,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740862860] [2022-11-02 21:07:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:41,125 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-02 21:07:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:41,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740862860] [2022-11-02 21:07:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740862860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:41,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:41,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:07:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936046032] [2022-11-02 21:07:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:41,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:07:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:07:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:41,128 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 21:07:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:41,509 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-11-02 21:07:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 21:07:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:41,511 INFO L225 Difference]: With dead ends: 214 [2022-11-02 21:07:41,511 INFO L226 Difference]: Without dead ends: 214 [2022-11-02 21:07:41,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:07:41,512 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 333 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:41,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 353 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-02 21:07:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2022-11-02 21:07:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 164 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-02 21:07:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2022-11-02 21:07:41,516 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 18 [2022-11-02 21:07:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:41,516 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2022-11-02 21:07:41,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 21:07:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2022-11-02 21:07:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 21:07:41,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:41,517 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] [2022-11-02 21:07:41,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:07:41,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2022-11-02 21:07:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:41,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260242192] [2022-11-02 21:07:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:41,837 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-02 21:07:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:41,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260242192] [2022-11-02 21:07:41,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260242192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:41,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:41,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:07:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343763124] [2022-11-02 21:07:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:41,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:07:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:07:41,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:41,840 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:42,317 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-11-02 21:07:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 21:07:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:42,319 INFO L225 Difference]: With dead ends: 164 [2022-11-02 21:07:42,319 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 21:07:42,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:42,320 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 183 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:42,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 325 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:07:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 21:07:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-02 21:07:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 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-02 21:07:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2022-11-02 21:07:42,324 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 20 [2022-11-02 21:07:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:42,324 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2022-11-02 21:07:42,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-11-02 21:07:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 21:07:42,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:42,325 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] [2022-11-02 21:07:42,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:07:42,325 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2022-11-02 21:07:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:42,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287948241] [2022-11-02 21:07:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:42,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:42,829 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-02 21:07:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:42,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287948241] [2022-11-02 21:07:42,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287948241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:42,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:42,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:07:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896819727] [2022-11-02 21:07:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:42,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:07:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:07:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:07:42,832 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:43,566 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2022-11-02 21:07:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:07:43,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-02 21:07:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:43,568 INFO L225 Difference]: With dead ends: 182 [2022-11-02 21:07:43,568 INFO L226 Difference]: Without dead ends: 182 [2022-11-02 21:07:43,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:07:43,569 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 233 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:43,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 391 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:07:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-02 21:07:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2022-11-02 21:07:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 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-02 21:07:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-11-02 21:07:43,573 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 20 [2022-11-02 21:07:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:43,573 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-11-02 21:07:43,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-11-02 21:07:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:07:43,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:43,575 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] [2022-11-02 21:07:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:07:43,575 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2022-11-02 21:07:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:43,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481500673] [2022-11-02 21:07:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:43,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481500673] [2022-11-02 21:07:43,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481500673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:43,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578879170] [2022-11-02 21:07:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:43,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:43,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:43,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:07:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:43,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 21:07:44,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:44,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:44,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:44,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:44,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:44,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:44,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:44,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:44,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:44,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:44,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:44,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:07:44,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:07:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:44,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:44,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578879170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:44,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:44,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-11-02 21:07:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729070642] [2022-11-02 21:07:44,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:44,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:07:44,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:07:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:07:44,678 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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-02 21:07:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:45,198 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2022-11-02 21:07:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:07:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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-02 21:07:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:45,199 INFO L225 Difference]: With dead ends: 219 [2022-11-02 21:07:45,199 INFO L226 Difference]: Without dead ends: 219 [2022-11-02 21:07:45,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:07:45,200 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 340 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:45,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 424 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:07:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-02 21:07:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 175. [2022-11-02 21:07:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 174 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 191 transitions. [2022-11-02 21:07:45,205 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 191 transitions. Word has length 25 [2022-11-02 21:07:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:45,205 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 191 transitions. [2022-11-02 21:07:45,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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-02 21:07:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 191 transitions. [2022-11-02 21:07:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 21:07:45,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:45,206 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-02 21:07:45,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:45,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:45,423 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:45,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2022-11-02 21:07:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451093397] [2022-11-02 21:07:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:45,563 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-02 21:07:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:45,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451093397] [2022-11-02 21:07:45,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451093397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:45,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:45,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676817901] [2022-11-02 21:07:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:45,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:45,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:45,567 INFO L87 Difference]: Start difference. First operand 175 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-02 21:07:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:45,732 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2022-11-02 21:07:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:45,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-02 21:07:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:45,733 INFO L225 Difference]: With dead ends: 179 [2022-11-02 21:07:45,733 INFO L226 Difference]: Without dead ends: 179 [2022-11-02 21:07:45,734 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-02 21:07:45,734 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 25 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:45,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 354 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-02 21:07:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2022-11-02 21:07:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 173 states have internal predecessors, (188), 0 states have call successors, (0), 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-02 21:07:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2022-11-02 21:07:45,738 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 25 [2022-11-02 21:07:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:45,738 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2022-11-02 21:07:45,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-02 21:07:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2022-11-02 21:07:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 21:07:45,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:45,745 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, 1] [2022-11-02 21:07:45,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:07:45,745 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2022-11-02 21:07:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:45,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47746736] [2022-11-02 21:07:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:45,864 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-02 21:07:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:45,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47746736] [2022-11-02 21:07:45,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47746736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:45,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:45,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112517553] [2022-11-02 21:07:45,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:45,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:45,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:45,870 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:45,984 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2022-11-02 21:07:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 21:07:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:45,986 INFO L225 Difference]: With dead ends: 176 [2022-11-02 21:07:45,986 INFO L226 Difference]: Without dead ends: 176 [2022-11-02 21:07:45,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 21:07:45,989 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 20 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:45,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 300 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-02 21:07:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2022-11-02 21:07:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2022-11-02 21:07:45,994 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 26 [2022-11-02 21:07:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:45,994 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2022-11-02 21:07:45,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2022-11-02 21:07:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 21:07:46,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:46,003 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, 1, 1, 1] [2022-11-02 21:07:46,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:07:46,003 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2022-11-02 21:07:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:46,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990830813] [2022-11-02 21:07:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:46,152 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-02 21:07:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:46,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990830813] [2022-11-02 21:07:46,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990830813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:46,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:46,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330692330] [2022-11-02 21:07:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:46,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:46,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:46,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:46,155 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-02 21:07:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:46,335 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2022-11-02 21:07:46,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:46,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-02 21:07:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:46,336 INFO L225 Difference]: With dead ends: 171 [2022-11-02 21:07:46,337 INFO L226 Difference]: Without dead ends: 171 [2022-11-02 21:07:46,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:46,337 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:46,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 327 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-02 21:07:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-11-02 21:07:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 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-02 21:07:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2022-11-02 21:07:46,341 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 28 [2022-11-02 21:07:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:46,341 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2022-11-02 21:07:46,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-02 21:07:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-11-02 21:07:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 21:07:46,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:46,342 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, 1, 1, 1] [2022-11-02 21:07:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:07:46,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2022-11-02 21:07:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700798019] [2022-11-02 21:07:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:46,632 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-02 21:07:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:46,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700798019] [2022-11-02 21:07:46,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700798019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:46,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:46,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094110908] [2022-11-02 21:07:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:46,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:07:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:07:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:07:46,635 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-02 21:07:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:46,826 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2022-11-02 21:07:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:07:46,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-02 21:07:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:46,827 INFO L225 Difference]: With dead ends: 170 [2022-11-02 21:07:46,827 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 21:07:46,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:46,828 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:46,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:07:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 21:07:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-02 21:07:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 169 states have internal predecessors, (183), 0 states have call successors, (0), 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-02 21:07:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2022-11-02 21:07:46,832 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 28 [2022-11-02 21:07:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:46,832 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2022-11-02 21:07:46,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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-02 21:07:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2022-11-02 21:07:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 21:07:46,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:46,833 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, 1, 1, 1, 1] [2022-11-02 21:07:46,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:07:46,833 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2022-11-02 21:07:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:46,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255055316] [2022-11-02 21:07:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,046 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-02 21:07:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:47,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255055316] [2022-11-02 21:07:47,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255055316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:47,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:47,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:07:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263412493] [2022-11-02 21:07:47,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:47,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:47,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:47,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:07:47,049 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:47,179 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-11-02 21:07:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:47,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 21:07:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:47,181 INFO L225 Difference]: With dead ends: 169 [2022-11-02 21:07:47,181 INFO L226 Difference]: Without dead ends: 169 [2022-11-02 21:07:47,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02 21:07:47,181 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:47,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 250 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-02 21:07:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-11-02 21:07:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 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-02 21:07:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2022-11-02 21:07:47,186 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 29 [2022-11-02 21:07:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:47,186 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2022-11-02 21:07:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2022-11-02 21:07:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:07:47,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:47,188 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, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:47,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:07:47,188 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2022-11-02 21:07:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:47,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021112904] [2022-11-02 21:07:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,594 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-02 21:07:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:47,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021112904] [2022-11-02 21:07:47,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021112904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:47,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:47,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:07:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922344576] [2022-11-02 21:07:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:47,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:07:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:07:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:07:47,597 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:48,268 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2022-11-02 21:07:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:07:48,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 21:07:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:48,270 INFO L225 Difference]: With dead ends: 205 [2022-11-02 21:07:48,270 INFO L226 Difference]: Without dead ends: 205 [2022-11-02 21:07:48,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:07:48,271 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 481 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:48,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 299 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:07:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-02 21:07:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2022-11-02 21:07:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.325925925925926) internal successors, (179), 167 states have internal predecessors, (179), 0 states have call successors, (0), 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-02 21:07:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2022-11-02 21:07:48,276 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 31 [2022-11-02 21:07:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:48,276 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2022-11-02 21:07:48,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2022-11-02 21:07:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 21:07:48,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:48,278 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, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:07:48,279 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2022-11-02 21:07:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:48,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049081793] [2022-11-02 21:07:48,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:48,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049081793] [2022-11-02 21:07:48,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049081793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:48,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571359794] [2022-11-02 21:07:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:48,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:48,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:48,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:48,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:07:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:48,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:07:48,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:48,636 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-02 21:07:48,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:07:48,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571359794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:48,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:07:48,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-02 21:07:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487682843] [2022-11-02 21:07:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:48,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:48,641 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:48,681 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-11-02 21:07:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-02 21:07:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:48,683 INFO L225 Difference]: With dead ends: 169 [2022-11-02 21:07:48,683 INFO L226 Difference]: Without dead ends: 169 [2022-11-02 21:07:48,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:48,685 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 72 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:48,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 127 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-02 21:07:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-11-02 21:07:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 168 states have internal predecessors, (179), 0 states have call successors, (0), 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-02 21:07:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2022-11-02 21:07:48,693 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 31 [2022-11-02 21:07:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:48,694 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2022-11-02 21:07:48,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-11-02 21:07:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:07:48,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:48,696 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:48,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:48,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:48,911 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:48,911 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2022-11-02 21:07:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:48,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468383579] [2022-11-02 21:07:48,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:49,213 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-02 21:07:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468383579] [2022-11-02 21:07:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468383579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:49,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:49,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281438298] [2022-11-02 21:07:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:49,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:07:49,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:07:49,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:49,216 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:49,571 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-11-02 21:07:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:07:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 21:07:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:49,572 INFO L225 Difference]: With dead ends: 169 [2022-11-02 21:07:49,572 INFO L226 Difference]: Without dead ends: 169 [2022-11-02 21:07:49,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:07:49,573 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 59 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:49,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 374 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-02 21:07:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2022-11-02 21:07:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 167 states have internal predecessors, (178), 0 states have call successors, (0), 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-02 21:07:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2022-11-02 21:07:49,577 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 32 [2022-11-02 21:07:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:49,577 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2022-11-02 21:07:49,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2022-11-02 21:07:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 21:07:49,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:49,578 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:49,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:07:49,579 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2022-11-02 21:07:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:49,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408020965] [2022-11-02 21:07:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:50,034 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-02 21:07:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:50,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408020965] [2022-11-02 21:07:50,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408020965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:50,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:50,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:07:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652506334] [2022-11-02 21:07:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:50,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:07:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:07:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:50,037 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:50,402 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2022-11-02 21:07:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 21:07:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:50,406 INFO L225 Difference]: With dead ends: 164 [2022-11-02 21:07:50,406 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 21:07:50,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:50,407 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 73 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:50,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 377 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:07:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 21:07:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2022-11-02 21:07:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 151 states have internal predecessors, (161), 0 states have call successors, (0), 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-02 21:07:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2022-11-02 21:07:50,411 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 32 [2022-11-02 21:07:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:50,411 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2022-11-02 21:07:50,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2022-11-02 21:07:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 21:07:50,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:50,412 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:50,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:07:50,412 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2022-11-02 21:07:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325280025] [2022-11-02 21:07:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325280025] [2022-11-02 21:07:50,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325280025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:50,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826794431] [2022-11-02 21:07:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:50,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:50,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:07:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:50,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:07:50,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:50,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:50,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:07:50,812 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-02 21:07:50,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:07:50,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826794431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:50,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:07:50,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-02 21:07:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552275188] [2022-11-02 21:07:50,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:50,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:07:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:07:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:50,815 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:50,893 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2022-11-02 21:07:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:07:50,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 21:07:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:50,894 INFO L225 Difference]: With dead ends: 161 [2022-11-02 21:07:50,894 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 21:07:50,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:07:50,896 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:50,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 278 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:07:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 21:07:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2022-11-02 21:07:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 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-02 21:07:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2022-11-02 21:07:50,901 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 33 [2022-11-02 21:07:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:50,901 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2022-11-02 21:07:50,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2022-11-02 21:07:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 21:07:50,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:50,902 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, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:50,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:51,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:51,119 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2022-11-02 21:07:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:51,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435710742] [2022-11-02 21:07:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:51,354 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-02 21:07:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:51,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435710742] [2022-11-02 21:07:51,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435710742] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:51,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649569005] [2022-11-02 21:07:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:51,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:51,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:07:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:51,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 21:07:51,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:51,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:51,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:51,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:51,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:51,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:51,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:51,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:07:51,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 21:07:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:51,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:52,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649569005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:52,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:52,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2022-11-02 21:07:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480199275] [2022-11-02 21:07:52,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:52,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:07:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:52,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:07:52,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:07:52,013 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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-02 21:07:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:52,706 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2022-11-02 21:07:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:07:52,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 34 [2022-11-02 21:07:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:52,707 INFO L225 Difference]: With dead ends: 210 [2022-11-02 21:07:52,707 INFO L226 Difference]: Without dead ends: 210 [2022-11-02 21:07:52,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-11-02 21:07:52,708 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 338 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:52,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 487 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:07:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-02 21:07:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 166. [2022-11-02 21:07:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 165 states have internal predecessors, (177), 0 states have call successors, (0), 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-02 21:07:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2022-11-02 21:07:52,712 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 34 [2022-11-02 21:07:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:52,712 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2022-11-02 21:07:52,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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-02 21:07:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2022-11-02 21:07:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 21:07:52,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:52,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:52,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:52,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 21:07:52,923 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 572484842, now seen corresponding path program 1 times [2022-11-02 21:07:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179171879] [2022-11-02 21:07:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 21:07:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179171879] [2022-11-02 21:07:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179171879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:52,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:52,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202791117] [2022-11-02 21:07:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:52,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:52,977 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-02 21:07:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:53,014 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-11-02 21:07:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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 35 [2022-11-02 21:07:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:53,016 INFO L225 Difference]: With dead ends: 165 [2022-11-02 21:07:53,016 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 21:07:53,016 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-02 21:07:53,017 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:53,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:07:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 21:07:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-02 21:07:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 164 states have internal predecessors, (175), 0 states have call successors, (0), 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-02 21:07:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2022-11-02 21:07:53,021 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 35 [2022-11-02 21:07:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:53,021 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2022-11-02 21:07:53,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 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-02 21:07:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2022-11-02 21:07:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 21:07:53,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:53,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:53,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:07:53,028 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash 402130029, now seen corresponding path program 1 times [2022-11-02 21:07:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65753676] [2022-11-02 21:07:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:53,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65753676] [2022-11-02 21:07:53,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65753676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:53,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609562853] [2022-11-02 21:07:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:53,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:53,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:53,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:53,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:07:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 21:07:53,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:53,525 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:53,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 18 treesize of output 32 [2022-11-02 21:07:53,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2022-11-02 21:07:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:53,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:07:54,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609562853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:54,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:54,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-11-02 21:07:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861322991] [2022-11-02 21:07:54,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:54,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:07:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:07:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:07:54,257 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 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-02 21:07:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:54,626 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-11-02 21:07:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:54,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 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-02 21:07:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:54,628 INFO L225 Difference]: With dead ends: 175 [2022-11-02 21:07:54,628 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 21:07:54,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:07:54,628 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 66 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:54,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 524 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 272 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2022-11-02 21:07:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 21:07:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-02 21:07:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 149 states have internal predecessors, (159), 0 states have call successors, (0), 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-02 21:07:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2022-11-02 21:07:54,632 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 37 [2022-11-02 21:07:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:54,632 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2022-11-02 21:07:54,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 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-02 21:07:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2022-11-02 21:07:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:07:54,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:54,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:54,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:07:54,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 21:07:54,834 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:07:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -426569403, now seen corresponding path program 1 times [2022-11-02 21:07:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:54,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719605862] [2022-11-02 21:07:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:55,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719605862] [2022-11-02 21:07:55,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719605862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:07:55,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038907280] [2022-11-02 21:07:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:55,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:07:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:55,808 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:07:55,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:07:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:56,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 21:07:56,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:07:56,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:07:56,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:07:56,106 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:07:56,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:07:56,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:07:56,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:07:56,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:07:56,252 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:07:56,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:07:56,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:07:56,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 21:07:56,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:07:56,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:07:56,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:07:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:56,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:07:56,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:07:56,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:07:56,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:07:56,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1581 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1582) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1581) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:07:56,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1582 (Array Int Int)) (v_ArrVal_1581 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1582) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1581) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1584)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:07:56,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:07:56,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-11-02 21:07:56,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-02 21:07:56,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-11-02 21:07:56,568 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or .cse0 (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1578 Int)) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))) (forall ((v_arrayElimCell_25 Int) (v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1578 Int) (v_ArrVal_1582 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)))) (or (= ~unnamed1~0~BLACK (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) (= ~unnamed1~0~BLACK (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1582) v_arrayElimCell_25 v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2))))) (or (not .cse0) (forall ((v_arrayElimCell_25 Int) (v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1578 Int) (v_ArrVal_1582 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1582) v_arrayElimCell_25 v_ArrVal_1584) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)))))) is different from false [2022-11-02 21:07:58,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:07:58,917 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-02 21:07:58,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-11-02 21:07:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:58,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038907280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:07:58,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:07:58,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 34 [2022-11-02 21:07:58,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005538705] [2022-11-02 21:07:58,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:07:58,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 21:07:58,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 21:07:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=635, Unknown=9, NotChecked=342, Total=1122 [2022-11-02 21:07:58,947 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 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-02 21:08:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:00,213 INFO L93 Difference]: Finished difference Result 360 states and 384 transitions. [2022-11-02 21:08:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:08:00,213 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 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 39 [2022-11-02 21:08:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:00,215 INFO L225 Difference]: With dead ends: 360 [2022-11-02 21:08:00,215 INFO L226 Difference]: Without dead ends: 360 [2022-11-02 21:08:00,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=244, Invalid=1103, Unknown=9, NotChecked=450, Total=1806 [2022-11-02 21:08:00,216 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 397 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1225 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:00,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 797 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 974 Invalid, 0 Unknown, 1225 Unchecked, 0.7s Time] [2022-11-02 21:08:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-02 21:08:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 176. [2022-11-02 21:08:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 152 states have (on average 1.230263157894737) internal successors, (187), 175 states have internal predecessors, (187), 0 states have call successors, (0), 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-02 21:08:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2022-11-02 21:08:00,221 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 39 [2022-11-02 21:08:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:00,221 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2022-11-02 21:08:00,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 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-02 21:08:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2022-11-02 21:08:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:08:00,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:00,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:00,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:00,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 21:08:00,423 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:08:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash 268919448, now seen corresponding path program 1 times [2022-11-02 21:08:00,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:00,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795916157] [2022-11-02 21:08:00,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:00,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:01,169 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-02 21:08:01,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795916157] [2022-11-02 21:08:01,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795916157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:01,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:01,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 21:08:01,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599879058] [2022-11-02 21:08:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:01,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:08:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:08:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:08:01,171 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:02,002 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2022-11-02 21:08:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:08:02,003 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-02 21:08:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:02,004 INFO L225 Difference]: With dead ends: 190 [2022-11-02 21:08:02,004 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 21:08:02,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2022-11-02 21:08:02,005 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 247 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:02,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 466 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:08:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 21:08:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 167. [2022-11-02 21:08:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 166 states have internal predecessors, (178), 0 states have call successors, (0), 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-02 21:08:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2022-11-02 21:08:02,009 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 41 [2022-11-02 21:08:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:02,009 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2022-11-02 21:08:02,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2022-11-02 21:08:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 21:08:02,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:02,010 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:02,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:08:02,012 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:08:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1035696014, now seen corresponding path program 1 times [2022-11-02 21:08:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:02,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15835476] [2022-11-02 21:08:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:02,596 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-02 21:08:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:02,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15835476] [2022-11-02 21:08:02,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15835476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:02,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917016069] [2022-11-02 21:08:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:02,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:02,599 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:02,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 21:08:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:02,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 21:08:02,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:02,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:02,896 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:08:02,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:08:02,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:03,052 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:03,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 21:08:03,164 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:03,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 21:08:03,211 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:03,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 21:08:03,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 21:08:03,499 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-02 21:08:03,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:03,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1815) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-11-02 21:08:03,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1815) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-11-02 21:08:03,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1815)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-11-02 21:08:03,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1815 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1815)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)) is different from false [2022-11-02 21:08:03,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:03,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-02 21:08:03,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:03,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-11-02 21:08:03,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-11-02 21:08:03,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:03,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2022-11-02 21:08:08,980 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-02 21:08:08,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917016069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:08,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:08,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 31 [2022-11-02 21:08:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991707175] [2022-11-02 21:08:08,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:08,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 21:08:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 21:08:08,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=16, NotChecked=220, Total=992 [2022-11-02 21:08:08,983 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 0 states have call successors, (0), 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-02 21:08:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:09,888 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2022-11-02 21:08:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 21:08:09,889 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 0 states have call successors, (0), 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-02 21:08:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:09,890 INFO L225 Difference]: With dead ends: 245 [2022-11-02 21:08:09,890 INFO L226 Difference]: Without dead ends: 245 [2022-11-02 21:08:09,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=239, Invalid=882, Unknown=17, NotChecked=268, Total=1406 [2022-11-02 21:08:09,891 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 455 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:09,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 726 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 744 Invalid, 0 Unknown, 1046 Unchecked, 0.6s Time] [2022-11-02 21:08:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-02 21:08:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 175. [2022-11-02 21:08:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.236842105263158) internal successors, (188), 174 states have internal predecessors, (188), 0 states have call successors, (0), 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-02 21:08:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2022-11-02 21:08:09,895 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 46 [2022-11-02 21:08:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:09,896 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2022-11-02 21:08:09,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 0 states have call successors, (0), 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-02 21:08:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2022-11-02 21:08:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 21:08:09,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:09,897 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:09,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:10,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:10,123 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:08:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1035696015, now seen corresponding path program 1 times [2022-11-02 21:08:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384434452] [2022-11-02 21:08:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:10,850 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-02 21:08:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384434452] [2022-11-02 21:08:10,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384434452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887755585] [2022-11-02 21:08:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:10,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:10,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 21:08:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:11,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-02 21:08:11,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:11,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:11,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:11,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:11,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:11,293 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:11,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-02 21:08:11,399 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:11,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 21:08:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:11,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:08:11,494 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:11,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 21:08:11,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 21:08:11,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-02 21:08:11,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 21:08:11,841 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-02 21:08:11,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:12,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:12,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-11-02 21:08:12,162 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 8))) (forall ((v_ArrVal_1954 (Array Int Int))) (= |c_ULTIMATE.start_main_~end~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1954) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_ArrVal_1955 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1955) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1)))) is different from false [2022-11-02 21:08:12,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:12,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 95 [2022-11-02 21:08:12,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2022-11-02 21:08:12,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2022-11-02 21:08:12,760 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-02 21:08:12,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887755585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:12,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:12,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2022-11-02 21:08:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831489354] [2022-11-02 21:08:12,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:12,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 21:08:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 21:08:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1143, Unknown=2, NotChecked=68, Total=1332 [2022-11-02 21:08:12,763 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 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-02 21:08:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:14,606 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2022-11-02 21:08:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 21:08:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 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 46 [2022-11-02 21:08:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:14,607 INFO L225 Difference]: With dead ends: 247 [2022-11-02 21:08:14,607 INFO L226 Difference]: Without dead ends: 247 [2022-11-02 21:08:14,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=416, Invalid=2448, Unknown=2, NotChecked=104, Total=2970 [2022-11-02 21:08:14,609 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 759 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 779 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:14,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 762 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1019 Invalid, 0 Unknown, 779 Unchecked, 0.8s Time] [2022-11-02 21:08:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-02 21:08:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2022-11-02 21:08:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.232258064516129) internal successors, (191), 177 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2022-11-02 21:08:14,614 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 46 [2022-11-02 21:08:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:14,614 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2022-11-02 21:08:14,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 37 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-02 21:08:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2022-11-02 21:08:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 21:08:14,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:14,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:14,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:14,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:14,841 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:08:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1558963792, now seen corresponding path program 1 times [2022-11-02 21:08:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:14,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780357797] [2022-11-02 21:08:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780357797] [2022-11-02 21:08:16,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780357797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482871254] [2022-11-02 21:08:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:16,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:16,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:16,468 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:16,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 21:08:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:16,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-02 21:08:16,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:16,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:16,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:08:16,804 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:16,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:16,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:08:16,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 21:08:16,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:16,972 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:16,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:08:16,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:08:17,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 21:08:17,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:08:17,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:08:17,184 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 21:08:17,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:08:17,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:08:17,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:17,331 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:17,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-02 21:08:17,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-02 21:08:17,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 21:08:17,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:08:17,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:08:17,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:08:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:17,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:17,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:08:17,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:08:17,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:08:17,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2155) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2022-11-02 21:08:17,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_2155) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2157)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2022-11-02 21:08:17,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:17,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-02 21:08:17,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-02 21:08:17,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-02 21:08:17,619 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimCell_71 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152))) (or (= ~unnamed1~0~BLACK (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2155) v_arrayElimCell_71 v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= ~unnamed1~0~BLACK (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (or (forall ((v_arrayElimCell_71 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2155) v_arrayElimCell_71 v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (not .cse2)) (or .cse2 (forall ((v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) is different from false [2022-11-02 21:08:18,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:18,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-11-02 21:08:18,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2022-11-02 21:08:18,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2022-11-02 21:08:18,241 INFO L356 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-11-02 21:08:18,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2022-11-02 21:08:18,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_73 Int) (v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_73 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= ~unnamed1~0~BLACK (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) .cse3) (or .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_arrayElimCell_73 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_73) (forall ((v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_73 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= ~unnamed1~0~BLACK (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (or (forall ((v_arrayElimCell_73 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_73 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_73) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (not .cse3)))) is different from false [2022-11-02 21:08:35,607 WARN L234 SmtUtils]: Spent 14.05s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:08:35,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:08:35,721 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-02 21:08:35,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 1 [2022-11-02 21:08:35,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:08:35,730 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-02 21:08:35,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 1 [2022-11-02 21:08:35,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:08:35,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:35,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2022-11-02 21:08:35,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:08:35,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 141 [2022-11-02 21:08:35,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2022-11-02 21:08:35,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-11-02 21:08:35,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:08:35,786 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-02 21:08:35,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 60 treesize of output 1 [2022-11-02 21:08:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:35,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482871254] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:35,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:35,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 21] total 54 [2022-11-02 21:08:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403129079] [2022-11-02 21:08:35,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:35,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-02 21:08:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-02 21:08:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1850, Unknown=29, NotChecked=672, Total=2862 [2022-11-02 21:08:35,849 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 0 states have call successors, (0), 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-02 21:08:36,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_73 Int) (v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_73 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= ~unnamed1~0~BLACK (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) .cse3) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select .cse2 .cse1) ~unnamed1~0~BLACK) (<= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (or .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int)) (or (forall ((v_arrayElimCell_73 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_73) (forall ((v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_73 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= ~unnamed1~0~BLACK (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (or (forall ((v_arrayElimCell_73 Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_7| Int) (v_ArrVal_2144 Int) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2144)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2147) v_arrayElimCell_73 v_ArrVal_2152) |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_ArrVal_2157) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_7| v_arrayElimCell_73) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_7|))) (not .cse3)) (= ~unnamed1~0~BLACK (select .cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8))) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= ~unnamed1~0~BLACK (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (not (= |c_ULTIMATE.start_main_~end~0#1.offset| .cse1)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2022-11-02 21:08:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:38,033 INFO L93 Difference]: Finished difference Result 477 states and 512 transitions. [2022-11-02 21:08:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 21:08:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 0 states have call successors, (0), 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-02 21:08:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:38,035 INFO L225 Difference]: With dead ends: 477 [2022-11-02 21:08:38,035 INFO L226 Difference]: Without dead ends: 477 [2022-11-02 21:08:38,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=612, Invalid=3296, Unknown=30, NotChecked=1032, Total=4970 [2022-11-02 21:08:38,038 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 722 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2703 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:38,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1161 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1397 Invalid, 0 Unknown, 2703 Unchecked, 1.1s Time] [2022-11-02 21:08:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-11-02 21:08:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 204. [2022-11-02 21:08:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 181 states have (on average 1.2044198895027625) internal successors, (218), 203 states have internal predecessors, (218), 0 states have call successors, (0), 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-02 21:08:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2022-11-02 21:08:38,047 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 49 [2022-11-02 21:08:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:38,047 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2022-11-02 21:08:38,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 0 states have call successors, (0), 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-02 21:08:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2022-11-02 21:08:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 21:08:38,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:38,048 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2022-11-02 21:08:38,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:38,279 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-11-02 21:08:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash 775361098, now seen corresponding path program 2 times [2022-11-02 21:08:38,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:38,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503381792] [2022-11-02 21:08:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503381792] [2022-11-02 21:08:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503381792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666729543] [2022-11-02 21:08:39,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:08:39,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:39,334 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:39,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca071be2-3db2-44ec-b14f-a13fb7aafbf9/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 21:08:39,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:08:39,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:08:39,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 21:08:39,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:39,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:08:39,732 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:08:39,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:08:39,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:39,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:39,932 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:39,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 21:08:39,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 21:08:40,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:08:40,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 21:08:40,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:40,115 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:40,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 21:08:40,210 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:08:40,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 21:08:40,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:08:40,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:08:40,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 21:08:40,895 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:08:40,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-02 21:08:40,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-02 21:08:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:40,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:41,343 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int))) (or (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|)) (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2299))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2300))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select v_ArrVal_2300 |c_ULTIMATE.start_main_~end~0#1.offset|))) (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_~end~0#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|))))) is different from false [2022-11-02 21:08:41,404 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2299))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_#t~mem6#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|)))) (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (select v_ArrVal_2300 |c_ULTIMATE.start_main_#t~mem6#1.offset|) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2300))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= (select v_ArrVal_2299 |c_ULTIMATE.start_main_#t~mem6#1.offset|) |c_ULTIMATE.start_main_~null~0#1.offset|))))) is different from false [2022-11-02 21:08:41,423 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2299))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 .cse2))))) (forall ((v_ArrVal_2299 (Array Int Int))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (select v_ArrVal_2300 .cse2) (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2300))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 .cse2))))))) is different from false [2022-11-02 21:08:41,460 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2296))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select v_ArrVal_2299 .cse0) |c_ULTIMATE.start_main_~null~0#1.offset|)) (forall ((v_ArrVal_2300 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2295))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse1 (store .cse2 .cse3 v_ArrVal_2300))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse4 .cse3 v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (select v_ArrVal_2300 .cse0))))))) (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2296))) (or (not (= (select v_ArrVal_2299 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) |c_ULTIMATE.start_main_~null~0#1.offset|)) (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2295))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse6 (store .cse5 .cse8 v_ArrVal_2299))) (select (select .cse6 (select (select (store .cse7 .cse8 v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))))))) is different from false [2022-11-02 21:08:41,507 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2296))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2295))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store .cse3 .cse2 v_ArrVal_2299))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_2300) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 (select (select .cse3 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (forall ((v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2296))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_2300 (Array Int Int))) (= (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2295))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse5 (store .cse6 .cse7 v_ArrVal_2300))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store .cse8 .cse7 v_ArrVal_2299) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (select v_ArrVal_2300 .cse9))) (not (= |c_ULTIMATE.start_main_~null~0#1.offset| (select v_ArrVal_2299 .cse9))))))))) is different from false [2022-11-02 21:08:41,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:41,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 125 [2022-11-02 21:08:41,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:41,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 72 [2022-11-02 21:08:42,003 INFO L356 Elim1Store]: treesize reduction 154, result has 69.8 percent of original size [2022-11-02 21:08:42,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 4342 treesize of output 3475 [2022-11-02 21:08:42,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:42,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5271 treesize of output 4914 [2022-11-02 21:08:42,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:42,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4675 treesize of output 4549 [2022-11-02 21:08:42,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:42,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4094 treesize of output 3760 [2022-11-02 21:08:42,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:42,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4299 treesize of output 4233 [2022-11-02 21:08:43,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:08:43,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4095 treesize of output 3797