./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN --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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- 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-6b4ec56 [2022-11-20 11:02:05,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:02:05,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:02:05,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:02:05,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:02:05,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:02:05,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:02:05,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:02:05,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:02:05,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:02:05,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:02:05,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:02:05,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:02:05,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:02:05,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:02:05,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:02:05,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:02:05,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:02:05,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:02:05,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:02:05,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:02:05,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:02:05,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:02:05,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:02:05,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:02:05,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:02:05,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:02:05,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:02:05,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:02:05,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:02:05,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:02:05,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:02:05,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:02:05,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:02:05,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:02:05,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:02:05,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:02:05,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:02:05,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:02:05,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:02:05,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:02:05,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:02:05,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:02:05,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:02:05,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:02:05,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:02:05,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:02:05,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:02:05,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:02:05,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:02:05,247 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:02:05,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:02:05,248 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:02:05,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:02:05,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:02:05,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:02:05,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:02:05,249 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:02:05,249 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:02:05,250 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:02:05,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:02:05,250 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:02:05,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:02:05,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:02:05,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:02:05,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:02:05,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:02:05,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:02:05,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:02:05,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:02:05,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:02:05,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:02:05,253 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_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/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_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2022-11-20 11:02:05,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:02:05,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:02:05,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:02:05,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:02:05,591 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:02:05,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2022-11-20 11:02:08,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:02:08,974 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:02:08,975 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i [2022-11-20 11:02:08,988 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/data/72c6883f2/0c01761427524686b578342293592c91/FLAG7f215b3b4 [2022-11-20 11:02:09,013 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/data/72c6883f2/0c01761427524686b578342293592c91 [2022-11-20 11:02:09,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:02:09,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:02:09,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:02:09,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:02:09,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:02:09,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b50ec0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09, skipping insertion in model container [2022-11-20 11:02:09,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:02:09,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:02:09,510 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-11-20 11:02:09,526 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-11-20 11:02:09,529 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-11-20 11:02:09,532 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-11-20 11:02:09,535 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-11-20 11:02:09,539 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-11-20 11:02:09,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:02:09,562 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:02:09,615 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-11-20 11:02:09,622 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-11-20 11:02:09,625 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-11-20 11:02:09,627 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-11-20 11:02:09,631 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-11-20 11:02:09,636 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-11-20 11:02:09,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:02:09,671 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:02:09,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09 WrapperNode [2022-11-20 11:02:09,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:02:09,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:02:09,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:02:09,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:02:09,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,744 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2022-11-20 11:02:09,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:02:09,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:02:09,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:02:09,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:02:09,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,786 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:02:09,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:02:09,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:02:09,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:02:09,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (1/1) ... [2022-11-20 11:02:09,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:02:09,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:02:09,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:02:09,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:02:09,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:02:09,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:02:09,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:02:09,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:02:09,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:02:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:02:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:02:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:02:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:02:09,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:02:10,052 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:02:10,067 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:02:10,577 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:02:10,585 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:02:10,585 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-20 11:02:10,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:02:10 BoogieIcfgContainer [2022-11-20 11:02:10,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:02:10,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:02:10,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:02:10,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:02:10,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:02:09" (1/3) ... [2022-11-20 11:02:10,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3216061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:02:10, skipping insertion in model container [2022-11-20 11:02:10,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:02:09" (2/3) ... [2022-11-20 11:02:10,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3216061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:02:10, skipping insertion in model container [2022-11-20 11:02:10,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:02:10" (3/3) ... [2022-11-20 11:02:10,606 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2022-11-20 11:02:10,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:02:10,629 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-20 11:02:10,706 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:02:10,717 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;@444bccd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:02:10,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-20 11:02:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 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-20 11:02:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:02:10,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:10,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:02:10,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-20 11:02:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:10,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555096891] [2022-11-20 11:02:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:11,002 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-20 11:02:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:11,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555096891] [2022-11-20 11:02:11,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555096891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:11,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:11,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:02:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197922993] [2022-11-20 11:02:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:11,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:02:11,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:02:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:02:11,045 INFO L87 Difference]: Start difference. First operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 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) 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-20 11:02:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:11,213 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-11-20 11:02:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:02:11,216 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-20 11:02:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:11,225 INFO L225 Difference]: With dead ends: 153 [2022-11-20 11:02:11,225 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 11:02:11,227 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-20 11:02:11,231 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:11,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 11:02:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-20 11:02:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2022-11-20 11:02:11,273 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2022-11-20 11:02:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:11,274 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2022-11-20 11:02:11,274 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-20 11:02:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2022-11-20 11:02:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 11:02:11,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:11,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 11:02:11,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:02:11,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-20 11:02:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:11,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738941060] [2022-11-20 11:02:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:11,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:11,434 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-20 11:02:11,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:11,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738941060] [2022-11-20 11:02:11,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738941060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:11,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:11,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:02:11,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94536584] [2022-11-20 11:02:11,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:11,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:02:11,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:11,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:02:11,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:02:11,438 INFO L87 Difference]: Start difference. First operand 131 states and 133 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-20 11:02:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:11,592 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-11-20 11:02:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:02:11,593 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-20 11:02:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:11,594 INFO L225 Difference]: With dead ends: 156 [2022-11-20 11:02:11,595 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 11:02:11,595 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-20 11:02:11,596 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:11,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 11:02:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2022-11-20 11:02:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2022-11-20 11:02:11,607 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2022-11-20 11:02:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:11,607 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2022-11-20 11:02:11,608 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-20 11:02:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2022-11-20 11:02:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:02:11,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:11,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:11,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:02:11,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:11,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2022-11-20 11:02:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:11,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653466580] [2022-11-20 11:02:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:11,912 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-20 11:02:11,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:11,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653466580] [2022-11-20 11:02:11,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653466580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:11,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:11,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:02:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931048997] [2022-11-20 11:02:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:11,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:02:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:02:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:02:11,916 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:12,279 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-11-20 11:02:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:02:12,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 11:02:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:12,284 INFO L225 Difference]: With dead ends: 241 [2022-11-20 11:02:12,284 INFO L226 Difference]: Without dead ends: 241 [2022-11-20 11:02:12,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:12,286 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 273 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:12,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 113 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:02:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-20 11:02:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2022-11-20 11:02:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2022-11-20 11:02:12,301 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2022-11-20 11:02:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:12,302 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2022-11-20 11:02:12,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2022-11-20 11:02:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:02:12,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:12,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:12,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:02:12,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2022-11-20 11:02:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737628827] [2022-11-20 11:02:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:12,359 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-20 11:02:12,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:12,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737628827] [2022-11-20 11:02:12,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737628827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:12,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:12,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:02:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129998993] [2022-11-20 11:02:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:12,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:02:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:02:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:02:12,363 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:12,547 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-20 11:02:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:02:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 11:02:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:12,548 INFO L225 Difference]: With dead ends: 157 [2022-11-20 11:02:12,548 INFO L226 Difference]: Without dead ends: 157 [2022-11-20 11:02:12,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:12,550 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 184 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:12,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 74 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:02:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-20 11:02:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-11-20 11:02:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-11-20 11:02:12,559 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2022-11-20 11:02:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:12,559 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-11-20 11:02:12,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-11-20 11:02:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:02:12,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:12,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:12,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:02:12,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-20 11:02:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:12,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203425168] [2022-11-20 11:02:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:12,832 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-20 11:02:12,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:12,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203425168] [2022-11-20 11:02:12,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203425168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:12,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:12,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:02:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880008997] [2022-11-20 11:02:12,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:12,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:02:12,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:12,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:02:12,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:12,835 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:13,101 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-20 11:02:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:02:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:02:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:13,103 INFO L225 Difference]: With dead ends: 151 [2022-11-20 11:02:13,103 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 11:02:13,103 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-20 11:02:13,104 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:13,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:02:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 11:02:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-20 11:02:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-11-20 11:02:13,111 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2022-11-20 11:02:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:13,112 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-11-20 11:02:13,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-11-20 11:02:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:02:13,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:13,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:13,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:02:13,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-20 11:02:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:13,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248930555] [2022-11-20 11:02:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:13,237 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-20 11:02:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:13,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248930555] [2022-11-20 11:02:13,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248930555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:13,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:13,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:02:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458518302] [2022-11-20 11:02:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:13,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:02:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:13,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:02:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:13,240 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:13,412 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-11-20 11:02:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:02:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:02:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:13,413 INFO L225 Difference]: With dead ends: 150 [2022-11-20 11:02:13,413 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 11:02:13,414 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-20 11:02:13,415 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 8 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:13,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 283 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 11:02:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-20 11:02:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2022-11-20 11:02:13,422 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2022-11-20 11:02:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:13,423 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2022-11-20 11:02:13,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-11-20 11:02:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:02:13,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:13,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:13,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:02:13,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2022-11-20 11:02:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:13,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271040539] [2022-11-20 11:02:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:13,618 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-20 11:02:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:13,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271040539] [2022-11-20 11:02:13,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271040539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:13,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:13,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:02:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242689880] [2022-11-20 11:02:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:13,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:02:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:02:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:13,620 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:13,786 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-11-20 11:02:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:02:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:02:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:13,788 INFO L225 Difference]: With dead ends: 149 [2022-11-20 11:02:13,788 INFO L226 Difference]: Without dead ends: 149 [2022-11-20 11:02:13,789 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-20 11:02:13,792 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 12 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:13,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 275 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-20 11:02:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-20 11:02:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 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-20 11:02:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-20 11:02:13,812 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2022-11-20 11:02:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:13,813 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-20 11:02:13,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-20 11:02:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:02:13,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:13,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:13,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:02:13,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:13,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2022-11-20 11:02:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:13,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049725185] [2022-11-20 11:02:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:14,114 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-20 11:02:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:14,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049725185] [2022-11-20 11:02:14,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049725185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:14,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:14,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:02:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717989992] [2022-11-20 11:02:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:14,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:02:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:14,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:02:14,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:14,117 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:14,306 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-11-20 11:02:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:02:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:02:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:14,308 INFO L225 Difference]: With dead ends: 148 [2022-11-20 11:02:14,308 INFO L226 Difference]: Without dead ends: 148 [2022-11-20 11:02:14,308 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-20 11:02:14,309 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:14,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:02:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-20 11:02:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-20 11:02:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 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-20 11:02:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-11-20 11:02:14,314 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2022-11-20 11:02:14,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:14,314 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-11-20 11:02:14,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-11-20 11:02:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:02:14,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:14,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:14,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:02:14,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-20 11:02:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:14,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926273786] [2022-11-20 11:02:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:14,645 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-20 11:02:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926273786] [2022-11-20 11:02:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926273786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:14,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:14,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:02:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973376131] [2022-11-20 11:02:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:14,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:02:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:14,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:02:14,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:02:14,648 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-20 11:02:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:14,984 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-11-20 11:02:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:02:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-20 11:02:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:14,985 INFO L225 Difference]: With dead ends: 152 [2022-11-20 11:02:14,985 INFO L226 Difference]: Without dead ends: 152 [2022-11-20 11:02:14,986 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-20 11:02:14,986 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 190 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:14,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 188 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:02:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-20 11:02:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-11-20 11:02:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2022-11-20 11:02:14,991 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2022-11-20 11:02:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:14,991 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2022-11-20 11:02:14,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-20 11:02:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-11-20 11:02:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:02:14,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:14,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:14,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:02:14,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-20 11:02:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966465658] [2022-11-20 11:02:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:15,378 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-20 11:02:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:15,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966465658] [2022-11-20 11:02:15,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966465658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:15,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:15,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:02:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591128717] [2022-11-20 11:02:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:15,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:02:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:02:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:02:15,381 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-20 11:02:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:16,111 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-11-20 11:02:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:02:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-20 11:02:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:16,113 INFO L225 Difference]: With dead ends: 149 [2022-11-20 11:02:16,113 INFO L226 Difference]: Without dead ends: 149 [2022-11-20 11:02:16,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:02:16,114 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 189 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:16,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 282 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:02:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-20 11:02:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2022-11-20 11:02:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-11-20 11:02:16,119 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2022-11-20 11:02:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:16,119 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-11-20 11:02:16,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-20 11:02:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-11-20 11:02:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:02:16,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:16,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:16,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:02:16,121 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2022-11-20 11:02:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:16,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714866814] [2022-11-20 11:02:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:16,376 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-20 11:02:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:16,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714866814] [2022-11-20 11:02:16,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714866814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:16,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:16,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:02:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228757134] [2022-11-20 11:02:16,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:16,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:02:16,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:02:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:02:16,378 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:16,720 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-11-20 11:02:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:02:16,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 11:02:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:16,721 INFO L225 Difference]: With dead ends: 126 [2022-11-20 11:02:16,722 INFO L226 Difference]: Without dead ends: 126 [2022-11-20 11:02:16,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:02:16,723 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 66 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:16,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 253 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:02:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-20 11:02:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-11-20 11:02:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2022-11-20 11:02:16,726 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2022-11-20 11:02:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:16,734 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2022-11-20 11:02:16,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2022-11-20 11:02:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:02:16,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:16,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:02:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:02:16,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2022-11-20 11:02:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:16,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283556587] [2022-11-20 11:02:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:17,080 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-20 11:02:17,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:17,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283556587] [2022-11-20 11:02:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283556587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:17,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:02:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337965708] [2022-11-20 11:02:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:02:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:02:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:02:17,083 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:17,469 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-11-20 11:02:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:02:17,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 11:02:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:17,470 INFO L225 Difference]: With dead ends: 125 [2022-11-20 11:02:17,470 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 11:02:17,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:02:17,471 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:17,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 263 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:02:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 11:02:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-11-20 11:02:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-11-20 11:02:17,474 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2022-11-20 11:02:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:17,475 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-11-20 11:02:17,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-11-20 11:02:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:02:17,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:17,476 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-20 11:02:17,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:02:17,476 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2022-11-20 11:02:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:17,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39483412] [2022-11-20 11:02:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:17,596 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-20 11:02:17,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:17,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39483412] [2022-11-20 11:02:17,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39483412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:17,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:17,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:02:17,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258807405] [2022-11-20 11:02:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:17,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:02:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:02:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:02:17,598 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-20 11:02:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:17,744 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-20 11:02:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:02:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-20 11:02:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:17,745 INFO L225 Difference]: With dead ends: 123 [2022-11-20 11:02:17,746 INFO L226 Difference]: Without dead ends: 123 [2022-11-20 11:02:17,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:02:17,746 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:17,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 113 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-20 11:02:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-11-20 11:02:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-11-20 11:02:17,750 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2022-11-20 11:02:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:17,750 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-11-20 11:02:17,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-20 11:02:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-11-20 11:02:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:02:17,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:17,751 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-20 11:02:17,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:02:17,751 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2022-11-20 11:02:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:17,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380981306] [2022-11-20 11:02:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:17,808 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-20 11:02:17,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:17,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380981306] [2022-11-20 11:02:17,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380981306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:17,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:17,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:02:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729899662] [2022-11-20 11:02:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:17,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:02:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:17,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:02:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:02:17,811 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-20 11:02:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:17,942 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-11-20 11:02:17,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:02:17,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-20 11:02:17,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:17,944 INFO L225 Difference]: With dead ends: 181 [2022-11-20 11:02:17,945 INFO L226 Difference]: Without dead ends: 181 [2022-11-20 11:02:17,945 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-20 11:02:17,945 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:17,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-20 11:02:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2022-11-20 11:02:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-11-20 11:02:17,950 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2022-11-20 11:02:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:17,950 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-11-20 11:02:17,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-20 11:02:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-11-20 11:02:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:02:17,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:17,951 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-20 11:02:17,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:02:17,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2022-11-20 11:02:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:17,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981797118] [2022-11-20 11:02:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:18,941 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-20 11:02:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:18,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981797118] [2022-11-20 11:02:18,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981797118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:18,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:18,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 11:02:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135663935] [2022-11-20 11:02:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:18,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:02:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:02:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:02:18,943 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 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-20 11:02:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:19,890 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-11-20 11:02:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:02:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 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-20 11:02:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:19,891 INFO L225 Difference]: With dead ends: 225 [2022-11-20 11:02:19,891 INFO L226 Difference]: Without dead ends: 225 [2022-11-20 11:02:19,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:02:19,892 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 284 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:19,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 490 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:02:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-20 11:02:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2022-11-20 11:02:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-20 11:02:19,896 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2022-11-20 11:02:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:19,897 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-20 11:02:19,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 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-20 11:02:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-20 11:02:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:02:19,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:19,897 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-20 11:02:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:02:19,898 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2022-11-20 11:02:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669789266] [2022-11-20 11:02:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:19,985 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-20 11:02:19,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:19,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669789266] [2022-11-20 11:02:19,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669789266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:19,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:19,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:02:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53416473] [2022-11-20 11:02:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:19,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:02:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:19,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:02:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:19,990 INFO L87 Difference]: Start difference. First operand 133 states and 144 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-20 11:02:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:20,119 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-20 11:02:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:02:20,119 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-20 11:02:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:20,120 INFO L225 Difference]: With dead ends: 131 [2022-11-20 11:02:20,120 INFO L226 Difference]: Without dead ends: 131 [2022-11-20 11:02:20,121 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-20 11:02:20,121 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:20,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 236 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-20 11:02:20,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-20 11:02:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-11-20 11:02:20,125 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2022-11-20 11:02:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:20,126 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-11-20 11:02:20,126 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-20 11:02:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-11-20 11:02:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:02:20,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:20,127 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-20 11:02:20,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:02:20,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:20,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:20,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2022-11-20 11:02:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:20,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264598372] [2022-11-20 11:02:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:20,514 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-20 11:02:20,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264598372] [2022-11-20 11:02:20,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264598372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:20,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:20,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:02:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166774280] [2022-11-20 11:02:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:20,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:02:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:02:20,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:02:20,517 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-20 11:02:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:21,036 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-11-20 11:02:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:02:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-20 11:02:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:21,038 INFO L225 Difference]: With dead ends: 185 [2022-11-20 11:02:21,038 INFO L226 Difference]: Without dead ends: 185 [2022-11-20 11:02:21,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:02:21,039 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 249 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:21,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 286 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:02:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-20 11:02:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2022-11-20 11:02:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2022-11-20 11:02:21,043 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2022-11-20 11:02:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:21,043 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2022-11-20 11:02:21,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-20 11:02:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2022-11-20 11:02:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 11:02:21,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:21,044 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-20 11:02:21,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:02:21,045 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2022-11-20 11:02:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:21,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46156054] [2022-11-20 11:02:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:21,604 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-20 11:02:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46156054] [2022-11-20 11:02:21,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46156054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:21,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:21,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:02:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305973736] [2022-11-20 11:02:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:21,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:02:21,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:02:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:02:21,607 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-20 11:02:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:22,260 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-11-20 11:02:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:02:22,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-20 11:02:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:22,262 INFO L225 Difference]: With dead ends: 217 [2022-11-20 11:02:22,262 INFO L226 Difference]: Without dead ends: 217 [2022-11-20 11:02:22,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:02:22,263 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 187 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:22,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 341 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:02:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-20 11:02:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2022-11-20 11:02:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-11-20 11:02:22,268 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2022-11-20 11:02:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:22,268 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-11-20 11:02:22,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 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-20 11:02:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-11-20 11:02:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 11:02:22,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:22,269 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] [2022-11-20 11:02:22,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:02:22,270 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2022-11-20 11:02:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973815323] [2022-11-20 11:02:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:23,065 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-20 11:02:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:23,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973815323] [2022-11-20 11:02:23,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973815323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:23,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:23,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 11:02:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742322827] [2022-11-20 11:02:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:23,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:02:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:02:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:02:23,067 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:23,949 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-11-20 11:02:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 11:02:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 11:02:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:23,951 INFO L225 Difference]: With dead ends: 215 [2022-11-20 11:02:23,951 INFO L226 Difference]: Without dead ends: 215 [2022-11-20 11:02:23,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-11-20 11:02:23,952 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 382 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:23,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 447 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:02:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-20 11:02:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2022-11-20 11:02:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-11-20 11:02:23,956 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 30 [2022-11-20 11:02:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:23,956 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-11-20 11:02:23,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-11-20 11:02:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:02:23,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:23,957 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] [2022-11-20 11:02:23,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:02:23,957 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash -245371248, now seen corresponding path program 1 times [2022-11-20 11:02:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:23,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322314056] [2022-11-20 11:02:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:24,025 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-20 11:02:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:24,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322314056] [2022-11-20 11:02:24,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322314056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:24,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:24,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:02:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545693965] [2022-11-20 11:02:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:24,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:02:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:02:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:02:24,027 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:24,150 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-11-20 11:02:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:02:24,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-20 11:02:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:24,151 INFO L225 Difference]: With dead ends: 136 [2022-11-20 11:02:24,152 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 11:02:24,152 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-20 11:02:24,153 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:24,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 211 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 11:02:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-20 11:02:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-11-20 11:02:24,156 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2022-11-20 11:02:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:24,157 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-11-20 11:02:24,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-11-20 11:02:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:02:24,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:24,158 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-20 11:02:24,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:02:24,158 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:24,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 984809453, now seen corresponding path program 1 times [2022-11-20 11:02:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:24,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354584930] [2022-11-20 11:02:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:24,246 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-20 11:02:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:24,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354584930] [2022-11-20 11:02:24,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354584930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:24,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:24,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:02:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634099380] [2022-11-20 11:02:24,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:24,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:02:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:02:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:02:24,249 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:24,387 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-11-20 11:02:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:02:24,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-20 11:02:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:24,388 INFO L225 Difference]: With dead ends: 152 [2022-11-20 11:02:24,388 INFO L226 Difference]: Without dead ends: 152 [2022-11-20 11:02:24,389 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-20 11:02:24,389 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 136 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:24,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:02:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-20 11:02:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2022-11-20 11:02:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2022-11-20 11:02:24,393 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2022-11-20 11:02:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:24,394 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2022-11-20 11:02:24,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2022-11-20 11:02:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 11:02:24,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:24,394 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] [2022-11-20 11:02:24,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 11:02:24,395 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:24,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -27234752, now seen corresponding path program 1 times [2022-11-20 11:02:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:24,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685551741] [2022-11-20 11:02:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:24,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:25,556 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-20 11:02:25,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685551741] [2022-11-20 11:02:25,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685551741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:02:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557677677] [2022-11-20 11:02:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:25,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:02:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:02:25,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:02:25,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:02:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:25,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 11:02:25,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:02:25,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:02:25,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:02:26,002 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:02:26,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:02:26,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:02:26,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:02:26,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 11:02:26,303 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:26,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 11:02:26,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:02:26,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 11:02:26,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:02:26,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:02:26,554 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 11:02:26,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:02:26,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:02:26,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:02:26,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:26,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-20 11:02:26,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 11:02:26,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-20 11:02:26,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:02:26,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 11:02:26,854 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-20 11:02:26,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:02:26,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-20 11:02:26,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-20 11:02:26,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-20 11:02:27,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:27,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-20 11:02:27,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-20 11:02:27,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-20 11:02:27,175 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) .cse1) (or (not .cse1) (forall ((v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869))) (or (forall ((v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)))))) is different from false [2022-11-20 11:02:27,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:27,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-20 11:02:27,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-20 11:02:27,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-20 11:02:27,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:27,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-11-20 11:02:27,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2022-11-20 11:02:27,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-20 11:02:35,003 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:02:35,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:02:35,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:35,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-20 11:02:35,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:02:35,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-20 11:02:35,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 11:02:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:02:35,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557677677] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:02:35,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:02:35,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 20] total 43 [2022-11-20 11:02:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977397394] [2022-11-20 11:02:35,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:02:35,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 11:02:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:35,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 11:02:35,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1206, Unknown=42, NotChecked=308, Total=1806 [2022-11-20 11:02:35,206 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:39,661 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0)))) is different from false [2022-11-20 11:02:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:40,402 INFO L93 Difference]: Finished difference Result 359 states and 371 transitions. [2022-11-20 11:02:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 11:02:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 0 states have call successors, (0), 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-20 11:02:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:40,407 INFO L225 Difference]: With dead ends: 359 [2022-11-20 11:02:40,408 INFO L226 Difference]: Without dead ends: 359 [2022-11-20 11:02:40,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=582, Invalid=2693, Unknown=51, NotChecked=580, Total=3906 [2022-11-20 11:02:40,410 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 478 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1931 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:40,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1263 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 960 Invalid, 0 Unknown, 1931 Unchecked, 1.0s Time] [2022-11-20 11:02:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-20 11:02:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 178. [2022-11-20 11:02:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 177 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2022-11-20 11:02:40,416 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 37 [2022-11-20 11:02:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:40,417 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2022-11-20 11:02:40,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-11-20 11:02:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 11:02:40,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:40,418 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] [2022-11-20 11:02:40,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:02:40,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:02:40,625 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash 421565270, now seen corresponding path program 1 times [2022-11-20 11:02:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:40,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240404066] [2022-11-20 11:02:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:41,160 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-20 11:02:41,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:41,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240404066] [2022-11-20 11:02:41,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240404066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:41,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:41,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:02:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192700487] [2022-11-20 11:02:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:41,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:02:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:02:41,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:02:41,163 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:41,845 INFO L93 Difference]: Finished difference Result 237 states and 244 transitions. [2022-11-20 11:02:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:02:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-20 11:02:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:41,847 INFO L225 Difference]: With dead ends: 237 [2022-11-20 11:02:41,847 INFO L226 Difference]: Without dead ends: 237 [2022-11-20 11:02:41,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:02:41,848 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 222 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:41,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 385 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:02:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-20 11:02:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 187. [2022-11-20 11:02:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 163 states have (on average 1.2269938650306749) internal successors, (200), 186 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-20 11:02:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2022-11-20 11:02:41,853 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 38 [2022-11-20 11:02:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:41,853 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2022-11-20 11:02:41,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2022-11-20 11:02:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:02:41,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:41,855 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] [2022-11-20 11:02:41,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:02:41,855 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:41,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 183621750, now seen corresponding path program 1 times [2022-11-20 11:02:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630568946] [2022-11-20 11:02:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:42,396 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-20 11:02:42,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:42,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630568946] [2022-11-20 11:02:42,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630568946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:42,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:42,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:02:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124951618] [2022-11-20 11:02:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:42,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 11:02:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 11:02:42,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:02:42,399 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:43,066 INFO L93 Difference]: Finished difference Result 236 states and 243 transitions. [2022-11-20 11:02:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:02:43,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:02:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:43,068 INFO L225 Difference]: With dead ends: 236 [2022-11-20 11:02:43,068 INFO L226 Difference]: Without dead ends: 236 [2022-11-20 11:02:43,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:02:43,069 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 239 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:43,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 290 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:02:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-20 11:02:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2022-11-20 11:02:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 164 states have (on average 1.225609756097561) internal successors, (201), 187 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2022-11-20 11:02:43,074 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 39 [2022-11-20 11:02:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:43,075 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2022-11-20 11:02:43,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2022-11-20 11:02:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:02:43,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:43,076 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] [2022-11-20 11:02:43,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 11:02:43,076 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086814, now seen corresponding path program 1 times [2022-11-20 11:02:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:43,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056652752] [2022-11-20 11:02:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:43,827 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-20 11:02:43,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:43,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056652752] [2022-11-20 11:02:43,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056652752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:02:43,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115005349] [2022-11-20 11:02:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:43,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:02:43,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:02:43,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:02:43,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:02:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:44,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 11:02:44,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:02:44,189 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:02:44,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:02:44,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:02:44,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:44,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:02:44,475 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:44,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:02:45,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:02:45,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:45,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-20 11:02:45,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:02:45,194 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-20 11:02:45,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:02:45,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:45,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-20 11:02:45,607 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2022-11-20 11:02:45,830 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1063))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1063))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2022-11-20 11:02:45,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1063))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_63|) (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-11-20 11:02:45,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:45,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-20 11:02:45,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:45,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2022-11-20 11:02:45,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:45,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2022-11-20 11:02:45,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2022-11-20 11:02:46,133 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 11:02:46,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 1 [2022-11-20 11:02:46,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:46,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-20 11:02:46,833 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-20 11:02:46,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115005349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:02:46,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:02:46,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2022-11-20 11:02:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253605269] [2022-11-20 11:02:46,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:02:46,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 11:02:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:46,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 11:02:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1231, Unknown=6, NotChecked=222, Total=1640 [2022-11-20 11:02:46,836 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:48,197 INFO L93 Difference]: Finished difference Result 218 states and 227 transitions. [2022-11-20 11:02:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 11:02:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 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-20 11:02:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:48,199 INFO L225 Difference]: With dead ends: 218 [2022-11-20 11:02:48,199 INFO L226 Difference]: Without dead ends: 218 [2022-11-20 11:02:48,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=390, Invalid=1968, Unknown=6, NotChecked=288, Total=2652 [2022-11-20 11:02:48,201 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 294 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:48,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 849 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 764 Invalid, 0 Unknown, 686 Unchecked, 0.7s Time] [2022-11-20 11:02:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-20 11:02:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2022-11-20 11:02:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.223529411764706) internal successors, (208), 193 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2022-11-20 11:02:48,205 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 39 [2022-11-20 11:02:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:48,206 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2022-11-20 11:02:48,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2022-11-20 11:02:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 11:02:48,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:48,209 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] [2022-11-20 11:02:48,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:02:48,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:02:48,420 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086815, now seen corresponding path program 1 times [2022-11-20 11:02:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:48,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582255194] [2022-11-20 11:02:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:48,807 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-20 11:02:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582255194] [2022-11-20 11:02:48,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582255194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:02:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088197589] [2022-11-20 11:02:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:02:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:02:48,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:02:48,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:02:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:48,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 11:02:48,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:02:49,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:02:49,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 11:02:49,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:02:49,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:49,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2022-11-20 11:02:49,456 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-20 11:02:49,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:02:49,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:49,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:02:49,669 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 11:02:49,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-20 11:02:49,685 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 11:02:49,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-11-20 11:02:49,850 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-20 11:02:49,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088197589] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:02:49,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:02:49,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-11-20 11:02:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855232042] [2022-11-20 11:02:49,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:02:49,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-20 11:02:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 11:02:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:02:49,852 INFO L87 Difference]: Start difference. First operand 194 states and 208 transitions. Second operand has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:50,411 INFO L93 Difference]: Finished difference Result 235 states and 250 transitions. [2022-11-20 11:02:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:02:50,412 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 11:02:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:50,413 INFO L225 Difference]: With dead ends: 235 [2022-11-20 11:02:50,413 INFO L226 Difference]: Without dead ends: 235 [2022-11-20 11:02:50,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-11-20 11:02:50,414 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 126 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:50,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 660 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 373 Invalid, 0 Unknown, 149 Unchecked, 0.4s Time] [2022-11-20 11:02:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-20 11:02:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 207. [2022-11-20 11:02:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 185 states have (on average 1.2216216216216216) internal successors, (226), 206 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2022-11-20 11:02:50,420 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 39 [2022-11-20 11:02:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2022-11-20 11:02:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2022-11-20 11:02:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:02:50,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:50,421 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] [2022-11-20 11:02:50,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:02:50,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 11:02:50,627 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1397307224, now seen corresponding path program 1 times [2022-11-20 11:02:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:50,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226984832] [2022-11-20 11:02:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:50,804 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-20 11:02:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:50,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226984832] [2022-11-20 11:02:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226984832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:02:50,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:02:50,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:02:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686022593] [2022-11-20 11:02:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:02:50,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:02:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:02:50,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:02:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:02:50,807 INFO L87 Difference]: Start difference. First operand 207 states and 226 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:02:51,268 INFO L93 Difference]: Finished difference Result 230 states and 241 transitions. [2022-11-20 11:02:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:02:51,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 11:02:51,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:02:51,270 INFO L225 Difference]: With dead ends: 230 [2022-11-20 11:02:51,270 INFO L226 Difference]: Without dead ends: 230 [2022-11-20 11:02:51,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:02:51,271 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:02:51,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 306 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:02:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-20 11:02:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2022-11-20 11:02:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 192 states have (on average 1.2239583333333333) internal successors, (235), 213 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 235 transitions. [2022-11-20 11:02:51,276 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 235 transitions. Word has length 40 [2022-11-20 11:02:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:02:51,276 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 235 transitions. [2022-11-20 11:02:51,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:02:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 235 transitions. [2022-11-20 11:02:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 11:02:51,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:02:51,277 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] [2022-11-20 11:02:51,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 11:02:51,278 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-20 11:02:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:02:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 402357860, now seen corresponding path program 1 times [2022-11-20 11:02:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:02:51,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481889672] [2022-11-20 11:02:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:02:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:02:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:02:53,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481889672] [2022-11-20 11:02:53,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481889672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:02:53,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736274752] [2022-11-20 11:02:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:02:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:02:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:02:53,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:02:53,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_780d5039-0a61-45e4-acca-845b83bfb8a5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:02:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:02:53,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 11:02:53,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:02:53,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:02:53,629 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 11:02:53,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 11:02:53,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 11:02:53,861 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:53,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 11:02:54,020 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:54,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-20 11:02:54,163 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:02:54,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-20 11:02:54,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:02:54,213 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 11:02:54,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:02:54,301 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 11:02:54,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-20 11:02:54,494 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-20 11:02:54,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2022-11-20 11:02:54,654 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 11:02:54,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-11-20 11:02:54,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 11:02:54,981 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-20 11:02:54,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2022-11-20 11:02:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:02:54,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:02:57,737 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-11-20 11:02:57,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-11-20 11:02:57,752 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-11-20 11:02:57,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:57,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-20 11:02:57,901 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_1346))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-11-20 11:02:58,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:58,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2022-11-20 11:02:58,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:58,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11906 treesize of output 10149 [2022-11-20 11:02:58,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:58,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10134 treesize of output 9268 [2022-11-20 11:02:58,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:58,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9246 treesize of output 7556 [2022-11-20 11:02:59,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:02:59,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7542 treesize of output 6910 [2022-11-20 11:02:59,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6902 treesize of output 6646 [2022-11-20 11:02:59,265 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-11-20 11:02:59,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61