./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 18:20:15,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:20:15,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:20:15,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:20:15,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:20:15,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:20:15,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:20:15,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:20:15,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:20:15,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:20:15,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:20:15,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:20:15,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:20:15,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:20:15,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:20:15,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:20:15,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:20:15,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:20:15,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:20:15,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:20:16,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:20:16,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:20:16,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:20:16,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:20:16,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:20:16,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:20:16,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:20:16,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:20:16,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:20:16,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:20:16,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:20:16,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:20:16,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:20:16,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:20:16,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:20:16,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:20:16,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:20:16,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:20:16,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:20:16,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:20:16,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:20:16,033 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:20:16,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:20:16,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:20:16,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:20:16,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:20:16,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:20:16,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:20:16,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:20:16,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:20:16,075 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:20:16,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:20:16,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:20:16,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:20:16,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:20:16,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:20:16,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:20:16,077 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:20:16,078 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:20:16,078 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:20:16,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:20:16,078 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:20:16,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:20:16,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:20:16,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:20:16,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:20:16,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:20:16,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:20:16,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:20:16,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:20:16,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:20:16,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:20:16,080 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:20:16,080 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:20:16,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:20:16,081 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R 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-25 18:20:16,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:20:16,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:20:16,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:20:16,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:20:16,442 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:20:16,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2022-11-25 18:20:19,478 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:20:19,784 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:20:19,789 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i [2022-11-25 18:20:19,806 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/data/11959fde4/a5dccaf3cc1341818a0555fed28a4c3e/FLAGe711cd714 [2022-11-25 18:20:19,834 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/data/11959fde4/a5dccaf3cc1341818a0555fed28a4c3e [2022-11-25 18:20:19,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:20:19,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:20:19,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:20:19,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:20:19,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:20:19,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:20:19" (1/1) ... [2022-11-25 18:20:19,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2729f4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:19, skipping insertion in model container [2022-11-25 18:20:19,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:20:19" (1/1) ... [2022-11-25 18:20:19,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:20:19,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:20:20,194 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-11-25 18:20:20,201 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-11-25 18:20:20,202 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-11-25 18:20:20,203 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-11-25 18:20:20,204 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-11-25 18:20:20,208 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-11-25 18:20:20,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:20:20,221 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:20:20,286 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-11-25 18:20:20,288 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-11-25 18:20:20,289 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-11-25 18:20:20,291 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-11-25 18:20:20,292 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-11-25 18:20:20,293 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_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-11-25 18:20:20,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:20:20,326 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:20:20,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20 WrapperNode [2022-11-25 18:20:20,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:20:20,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:20:20,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:20:20,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:20:20,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,386 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2022-11-25 18:20:20,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:20:20,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:20:20,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:20:20,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:20:20,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,418 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:20:20,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:20:20,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:20:20,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:20:20,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (1/1) ... [2022-11-25 18:20:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:20:20,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:20:20,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:20:20,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:20:20,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:20:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:20:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:20:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:20:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:20:20,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:20:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:20:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:20:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:20:20,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:20:20,704 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:20:20,706 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:20:21,183 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:20:21,190 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:20:21,191 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-25 18:20:21,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:20:21 BoogieIcfgContainer [2022-11-25 18:20:21,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:20:21,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:20:21,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:20:21,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:20:21,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:20:19" (1/3) ... [2022-11-25 18:20:21,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39be9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:20:21, skipping insertion in model container [2022-11-25 18:20:21,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:20:20" (2/3) ... [2022-11-25 18:20:21,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39be9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:20:21, skipping insertion in model container [2022-11-25 18:20:21,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:20:21" (3/3) ... [2022-11-25 18:20:21,214 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2022-11-25 18:20:21,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:20:21,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-25 18:20:21,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:20:21,337 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=PETRI_NET, 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;@2df2400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:20:21,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-25 18:20:21,343 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-25 18:20:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:20:21,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:21,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:20:21,355 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-25 18:20:21,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-25 18:20:21,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:21,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438778534] [2022-11-25 18:20:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:21,647 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-25 18:20:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:21,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438778534] [2022-11-25 18:20:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438778534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:21,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:21,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:20:21,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166627330] [2022-11-25 18:20:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:21,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:20:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:21,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:20:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:20:21,711 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-25 18:20:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:21,971 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-11-25 18:20:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:20:21,974 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-25 18:20:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:21,984 INFO L225 Difference]: With dead ends: 153 [2022-11-25 18:20:21,984 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 18:20:21,986 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-25 18:20:22,005 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.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:22,006 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.2s Time] [2022-11-25 18:20:22,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 18:20:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-25 18:20:22,057 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-25 18:20:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2022-11-25 18:20:22,061 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2022-11-25 18:20:22,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:22,061 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2022-11-25 18:20:22,062 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-25 18:20:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2022-11-25 18:20:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 18:20:22,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:22,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 18:20:22,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:20:22,063 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-25 18:20:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-25 18:20:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:22,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654732658] [2022-11-25 18:20:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:22,209 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-25 18:20:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:22,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654732658] [2022-11-25 18:20:22,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654732658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:22,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:22,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:20:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133811516] [2022-11-25 18:20:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:22,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:20:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:20:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:20:22,214 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-25 18:20:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:22,359 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-11-25 18:20:22,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:20:22,359 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-25 18:20:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:22,361 INFO L225 Difference]: With dead ends: 156 [2022-11-25 18:20:22,361 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 18:20:22,361 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-25 18:20:22,363 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-25 18:20:22,363 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-25 18:20:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 18:20:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2022-11-25 18:20:22,385 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-25 18:20:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2022-11-25 18:20:22,386 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2022-11-25 18:20:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:22,387 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2022-11-25 18:20:22,387 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-25 18:20:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2022-11-25 18:20:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 18:20:22,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:22,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:22,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:20:22,389 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-25 18:20:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2022-11-25 18:20:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:22,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424528472] [2022-11-25 18:20:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:22,683 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-25 18:20:22,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:22,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424528472] [2022-11-25 18:20:22,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424528472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:22,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:22,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:22,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815306551] [2022-11-25 18:20:22,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:22,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:22,693 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-25 18:20:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:23,034 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-11-25 18:20:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:20:23,035 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-25 18:20:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:23,041 INFO L225 Difference]: With dead ends: 241 [2022-11-25 18:20:23,041 INFO L226 Difference]: Without dead ends: 241 [2022-11-25 18:20:23,043 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-25 18:20:23,046 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 273 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-25 18:20:23,048 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-25 18:20:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-25 18:20:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2022-11-25 18:20:23,063 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-25 18:20:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2022-11-25 18:20:23,065 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2022-11-25 18:20:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:23,066 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2022-11-25 18:20:23,066 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-25 18:20:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2022-11-25 18:20:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 18:20:23,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:23,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:23,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:20:23,067 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-25 18:20:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2022-11-25 18:20:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:23,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556942828] [2022-11-25 18:20:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:23,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556942828] [2022-11-25 18:20:23,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556942828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:23,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:23,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531711466] [2022-11-25 18:20:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:23,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:23,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:23,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:23,128 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-25 18:20:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:23,285 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-25 18:20:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:23,286 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-25 18:20:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:23,287 INFO L225 Difference]: With dead ends: 157 [2022-11-25 18:20:23,287 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 18:20:23,287 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-25 18:20:23,288 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:23,289 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.1s Time] [2022-11-25 18:20:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 18:20:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-11-25 18:20:23,296 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-25 18:20:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-11-25 18:20:23,297 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2022-11-25 18:20:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:23,298 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-11-25 18:20:23,298 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-25 18:20:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-11-25 18:20:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:20:23,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:23,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:23,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:20:23,300 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-25 18:20:23,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-25 18:20:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:23,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740742285] [2022-11-25 18:20:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:23,592 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-25 18:20:23,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740742285] [2022-11-25 18:20:23,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740742285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:23,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:23,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129824989] [2022-11-25 18:20:23,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:23,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:23,599 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-25 18:20:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:23,781 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-25 18:20:23,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:23,782 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-25 18:20:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:23,783 INFO L225 Difference]: With dead ends: 151 [2022-11-25 18:20:23,783 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 18:20:23,783 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-25 18:20:23,784 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:23,784 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.1s Time] [2022-11-25 18:20:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 18:20:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-25 18:20:23,790 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-25 18:20:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-11-25 18:20:23,791 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2022-11-25 18:20:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:23,792 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-11-25 18:20:23,792 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-25 18:20:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-11-25 18:20:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 18:20:23,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:23,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:23,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:20:23,793 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-25 18:20:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-25 18:20:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:23,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32521613] [2022-11-25 18:20:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:23,895 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-25 18:20:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32521613] [2022-11-25 18:20:23,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32521613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:23,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:23,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13857662] [2022-11-25 18:20:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:23,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:23,898 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-25 18:20:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:24,051 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-11-25 18:20:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:20:24,052 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-25 18:20:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:24,052 INFO L225 Difference]: With dead ends: 150 [2022-11-25 18:20:24,053 INFO L226 Difference]: Without dead ends: 150 [2022-11-25 18:20:24,053 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-25 18:20:24,054 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-25 18:20:24,054 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-25 18:20:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-25 18:20:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-25 18:20:24,059 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-25 18:20:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2022-11-25 18:20:24,060 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2022-11-25 18:20:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:24,060 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2022-11-25 18:20:24,060 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-25 18:20:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-11-25 18:20:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 18:20:24,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:24,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:24,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:20:24,061 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-25 18:20:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:24,062 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2022-11-25 18:20:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:24,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740746830] [2022-11-25 18:20:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:24,175 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-25 18:20:24,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:24,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740746830] [2022-11-25 18:20:24,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740746830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:24,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:24,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:24,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652280081] [2022-11-25 18:20:24,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:24,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:24,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:24,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:24,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:24,177 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-25 18:20:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:24,333 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-11-25 18:20:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:20:24,334 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-25 18:20:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:24,335 INFO L225 Difference]: With dead ends: 149 [2022-11-25 18:20:24,335 INFO L226 Difference]: Without dead ends: 149 [2022-11-25 18:20:24,335 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-25 18:20:24,336 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-25 18:20:24,336 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-25 18:20:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-25 18:20:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-25 18:20:24,340 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-25 18:20:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-25 18:20:24,341 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2022-11-25 18:20:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:24,341 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-25 18:20:24,341 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-25 18:20:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-25 18:20:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 18:20:24,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:24,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:24,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:20:24,343 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-25 18:20:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2022-11-25 18:20:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:24,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861512589] [2022-11-25 18:20:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:24,536 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-25 18:20:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:24,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861512589] [2022-11-25 18:20:24,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861512589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:24,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:24,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188559231] [2022-11-25 18:20:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:24,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:24,539 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-25 18:20:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:24,717 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-11-25 18:20:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:24,718 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-25 18:20:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:24,719 INFO L225 Difference]: With dead ends: 148 [2022-11-25 18:20:24,719 INFO L226 Difference]: Without dead ends: 148 [2022-11-25 18:20:24,719 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-25 18:20:24,720 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:24,720 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.1s Time] [2022-11-25 18:20:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-25 18:20:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-25 18:20:24,723 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-25 18:20:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-11-25 18:20:24,724 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2022-11-25 18:20:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:24,725 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-11-25 18:20:24,725 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-25 18:20:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-11-25 18:20:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 18:20:24,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:24,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:20:24,727 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-25 18:20:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-25 18:20:24,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:24,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068047640] [2022-11-25 18:20:24,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:24,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:24,948 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-25 18:20:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:24,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068047640] [2022-11-25 18:20:24,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068047640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:24,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:24,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:20:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124810913] [2022-11-25 18:20:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:24,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:20:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:20:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:20:24,952 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-25 18:20:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:25,260 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-11-25 18:20:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:20:25,261 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-25 18:20:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:25,261 INFO L225 Difference]: With dead ends: 152 [2022-11-25 18:20:25,262 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 18:20:25,262 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-25 18:20:25,263 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 188 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:25,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 188 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:20:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 18:20:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-11-25 18:20:25,266 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-25 18:20:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2022-11-25 18:20:25,267 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2022-11-25 18:20:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:25,268 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2022-11-25 18:20:25,268 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-25 18:20:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-11-25 18:20:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 18:20:25,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:25,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:25,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:20:25,270 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-25 18:20:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-25 18:20:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:25,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074768286] [2022-11-25 18:20:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:25,672 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-25 18:20:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:25,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074768286] [2022-11-25 18:20:25,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074768286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:25,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:25,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:20:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271954277] [2022-11-25 18:20:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:25,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:20:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:20:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:20:25,675 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-25 18:20:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:26,314 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-11-25 18:20:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:20:26,314 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-25 18:20:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:26,315 INFO L225 Difference]: With dead ends: 149 [2022-11-25 18:20:26,315 INFO L226 Difference]: Without dead ends: 149 [2022-11-25 18:20:26,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:20:26,316 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 188 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:26,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 282 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:20:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-25 18:20:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2022-11-25 18:20:26,320 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-25 18:20:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-11-25 18:20:26,321 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2022-11-25 18:20:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:26,321 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-11-25 18:20:26,322 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-25 18:20:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-11-25 18:20:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:20:26,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:26,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:26,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:20:26,323 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-25 18:20:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2022-11-25 18:20:26,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:26,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684715551] [2022-11-25 18:20:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:26,528 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-25 18:20:26,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:26,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684715551] [2022-11-25 18:20:26,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684715551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:26,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:26,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:20:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294732893] [2022-11-25 18:20:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:26,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:20:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:26,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:20:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:20:26,531 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-25 18:20:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:26,830 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-11-25 18:20:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:20:26,831 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-25 18:20:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:26,832 INFO L225 Difference]: With dead ends: 126 [2022-11-25 18:20:26,832 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 18:20:26,832 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-25 18:20:26,833 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:26,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 253 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:20:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 18:20:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-11-25 18:20:26,836 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-25 18:20:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2022-11-25 18:20:26,836 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2022-11-25 18:20:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:26,837 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2022-11-25 18:20:26,837 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-25 18:20:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2022-11-25 18:20:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:20:26,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:26,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:26,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:20:26,838 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-25 18:20:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2022-11-25 18:20:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:26,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728002869] [2022-11-25 18:20:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:27,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:27,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728002869] [2022-11-25 18:20:27,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728002869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:27,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:27,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:20:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408013412] [2022-11-25 18:20:27,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:27,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:20:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:27,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:20:27,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:20:27,164 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-25 18:20:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:27,500 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-11-25 18:20:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:20:27,501 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-25 18:20:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:27,502 INFO L225 Difference]: With dead ends: 125 [2022-11-25 18:20:27,502 INFO L226 Difference]: Without dead ends: 125 [2022-11-25 18:20:27,502 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-25 18:20:27,503 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 63 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:27,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 263 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:20:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-25 18:20:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-11-25 18:20:27,506 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-25 18:20:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-11-25 18:20:27,507 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2022-11-25 18:20:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:27,507 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-11-25 18:20:27,507 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-25 18:20:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-11-25 18:20:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:20:27,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:27,508 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-25 18:20:27,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:20:27,509 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-25 18:20:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2022-11-25 18:20:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203294465] [2022-11-25 18:20:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:27,646 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-25 18:20:27,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:27,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203294465] [2022-11-25 18:20:27,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203294465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:27,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:27,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875095674] [2022-11-25 18:20:27,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:20:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:20:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:20:27,649 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-25 18:20:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:27,788 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-25 18:20:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:20:27,789 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-25 18:20:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:27,789 INFO L225 Difference]: With dead ends: 123 [2022-11-25 18:20:27,790 INFO L226 Difference]: Without dead ends: 123 [2022-11-25 18:20:27,790 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-25 18:20:27,791 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 146 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:27,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 113 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:20:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-25 18:20:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-11-25 18:20:27,793 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-25 18:20:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-11-25 18:20:27,794 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2022-11-25 18:20:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:27,794 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-11-25 18:20:27,795 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-25 18:20:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-11-25 18:20:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 18:20:27,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:27,795 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-25 18:20:27,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:20:27,796 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-25 18:20:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2022-11-25 18:20:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:27,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441796023] [2022-11-25 18:20:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:27,860 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-25 18:20:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:27,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441796023] [2022-11-25 18:20:27,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441796023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:27,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:27,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391444372] [2022-11-25 18:20:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:27,862 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-25 18:20:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:27,975 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-11-25 18:20:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:27,975 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-25 18:20:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:27,976 INFO L225 Difference]: With dead ends: 181 [2022-11-25 18:20:27,976 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 18:20:27,977 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-25 18:20:27,977 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-25 18:20:27,978 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-25 18:20:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 18:20:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2022-11-25 18:20:27,980 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-25 18:20:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-11-25 18:20:27,981 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2022-11-25 18:20:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:27,981 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-11-25 18:20:27,981 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-25 18:20:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-11-25 18:20:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:20:27,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:27,982 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-25 18:20:27,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:20:27,985 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-25 18:20:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2022-11-25 18:20:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:27,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248368124] [2022-11-25 18:20:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:28,896 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-25 18:20:28,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248368124] [2022-11-25 18:20:28,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248368124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:28,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:28,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 18:20:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305197579] [2022-11-25 18:20:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:28,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 18:20:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:28,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 18:20:28,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:20:28,898 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-25 18:20:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:29,732 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-11-25 18:20:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:20:29,733 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-25 18:20:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:29,734 INFO L225 Difference]: With dead ends: 225 [2022-11-25 18:20:29,734 INFO L226 Difference]: Without dead ends: 225 [2022-11-25 18:20:29,735 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-25 18:20:29,735 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 283 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:29,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 490 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:20:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-25 18:20:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2022-11-25 18:20:29,739 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-25 18:20:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-25 18:20:29,740 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2022-11-25 18:20:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:29,740 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-25 18:20:29,740 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-25 18:20:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-25 18:20:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:20:29,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:29,741 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-25 18:20:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:20:29,741 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-25 18:20:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2022-11-25 18:20:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:29,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076898628] [2022-11-25 18:20:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:29,809 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-25 18:20:29,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:29,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076898628] [2022-11-25 18:20:29,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076898628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:29,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:29,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280777269] [2022-11-25 18:20:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:29,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:29,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:29,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:29,812 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-25 18:20:29,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:29,930 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-25 18:20:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:29,931 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-25 18:20:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:29,931 INFO L225 Difference]: With dead ends: 131 [2022-11-25 18:20:29,931 INFO L226 Difference]: Without dead ends: 131 [2022-11-25 18:20:29,932 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-25 18:20:29,932 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-25 18:20:29,932 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-25 18:20:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-25 18:20:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-25 18:20:29,935 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-25 18:20:29,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-11-25 18:20:29,936 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2022-11-25 18:20:29,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:29,936 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-11-25 18:20:29,936 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-25 18:20:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-11-25 18:20:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:20:29,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:29,937 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-25 18:20:29,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:20:29,937 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-25 18:20:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2022-11-25 18:20:29,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:29,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963794900] [2022-11-25 18:20:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:30,314 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-25 18:20:30,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963794900] [2022-11-25 18:20:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963794900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:30,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:30,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:20:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686737401] [2022-11-25 18:20:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:30,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:20:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:20:30,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:20:30,316 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-25 18:20:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:30,807 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-11-25 18:20:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:20:30,807 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-25 18:20:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:30,808 INFO L225 Difference]: With dead ends: 185 [2022-11-25 18:20:30,809 INFO L226 Difference]: Without dead ends: 185 [2022-11-25 18:20:30,809 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-25 18:20:30,809 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 237 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:30,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 286 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:20:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-25 18:20:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2022-11-25 18:20:30,813 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-25 18:20:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2022-11-25 18:20:30,813 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2022-11-25 18:20:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:30,814 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2022-11-25 18:20:30,814 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-25 18:20:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2022-11-25 18:20:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:20:30,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:30,814 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-25 18:20:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:20:30,815 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-25 18:20:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2022-11-25 18:20:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:30,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392026787] [2022-11-25 18:20:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:31,407 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-25 18:20:31,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:31,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392026787] [2022-11-25 18:20:31,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392026787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:31,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:31,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:20:31,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941839891] [2022-11-25 18:20:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:31,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:20:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:20:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:20:31,409 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-25 18:20:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:32,032 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-11-25 18:20:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:20:32,033 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-25 18:20:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:32,034 INFO L225 Difference]: With dead ends: 217 [2022-11-25 18:20:32,034 INFO L226 Difference]: Without dead ends: 217 [2022-11-25 18:20:32,034 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-25 18:20:32,035 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 179 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:32,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 341 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:20:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-25 18:20:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2022-11-25 18:20:32,038 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-25 18:20:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-11-25 18:20:32,040 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2022-11-25 18:20:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:32,041 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-11-25 18:20:32,041 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-25 18:20:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-11-25 18:20:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:20:32,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:32,043 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-25 18:20:32,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:20:32,044 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-25 18:20:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2022-11-25 18:20:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:32,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406242318] [2022-11-25 18:20:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:32,824 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-25 18:20:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:32,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406242318] [2022-11-25 18:20:32,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406242318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:32,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:32,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 18:20:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347444988] [2022-11-25 18:20:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:32,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:20:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:20:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:20:32,826 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-25 18:20:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:33,593 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-11-25 18:20:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:20:33,594 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-25 18:20:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:33,595 INFO L225 Difference]: With dead ends: 215 [2022-11-25 18:20:33,595 INFO L226 Difference]: Without dead ends: 215 [2022-11-25 18:20:33,596 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-25 18:20:33,596 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 368 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 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.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:33,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 447 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:20:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-25 18:20:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2022-11-25 18:20:33,600 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-25 18:20:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-11-25 18:20:33,600 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 30 [2022-11-25 18:20:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:33,602 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-11-25 18:20:33,603 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-25 18:20:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-11-25 18:20:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 18:20:33,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:33,623 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-25 18:20:33,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:20:33,624 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-25 18:20:33,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -245371248, now seen corresponding path program 1 times [2022-11-25 18:20:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:33,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496409789] [2022-11-25 18:20:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:33,713 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-25 18:20:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:33,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496409789] [2022-11-25 18:20:33,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496409789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:33,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:33,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020786443] [2022-11-25 18:20:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:33,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:33,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:33,716 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-25 18:20:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:33,832 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-11-25 18:20:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:33,832 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-25 18:20:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:33,833 INFO L225 Difference]: With dead ends: 136 [2022-11-25 18:20:33,833 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 18:20:33,833 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-25 18:20:33,834 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-25 18:20:33,834 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-25 18:20:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 18:20:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-25 18:20:33,837 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-25 18:20:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-11-25 18:20:33,837 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2022-11-25 18:20:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:33,838 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-11-25 18:20:33,838 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-25 18:20:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-11-25 18:20:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:20:33,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:33,838 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-25 18:20:33,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:20:33,839 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-25 18:20:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash 984809453, now seen corresponding path program 1 times [2022-11-25 18:20:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371425068] [2022-11-25 18:20:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:33,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:33,920 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-25 18:20:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:33,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371425068] [2022-11-25 18:20:33,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371425068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:33,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:33,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:33,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707104374] [2022-11-25 18:20:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:33,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:33,922 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-25 18:20:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:34,047 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-11-25 18:20:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:20:34,048 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-25 18:20:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:34,048 INFO L225 Difference]: With dead ends: 152 [2022-11-25 18:20:34,049 INFO L226 Difference]: Without dead ends: 152 [2022-11-25 18:20:34,049 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-25 18:20:34,049 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-25 18:20:34,050 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-25 18:20:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-25 18:20:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2022-11-25 18:20:34,052 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-25 18:20:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2022-11-25 18:20:34,053 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2022-11-25 18:20:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:34,053 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2022-11-25 18:20:34,054 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-25 18:20:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2022-11-25 18:20:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:20:34,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:34,054 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-25 18:20:34,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:20:34,055 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-25 18:20:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -27234752, now seen corresponding path program 1 times [2022-11-25 18:20:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:34,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706526802] [2022-11-25 18:20:34,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:35,101 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-25 18:20:35,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:35,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706526802] [2022-11-25 18:20:35,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706526802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:35,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405292910] [2022-11-25 18:20:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:35,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:20:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:20:35,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:20:35,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:20:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:35,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 18:20:35,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:35,352 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-25 18:20:35,372 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-25 18:20:35,435 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:20:35,436 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-25 18:20:35,531 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-25 18:20:35,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:35,542 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-25 18:20:35,726 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:20:35,726 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-25 18:20:35,735 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-25 18:20:35,774 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-25 18:20:35,847 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-25 18:20:35,903 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-25 18:20:35,935 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:20:35,936 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-25 18:20:35,960 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-25 18:20:35,971 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-25 18:20:36,100 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:20:36,101 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-25 18:20:36,108 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-25 18:20:36,136 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-25 18:20:36,151 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-25 18:20:36,181 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-25 18:20:36,184 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-25 18:20:36,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:20:36,375 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-25 18:20:36,389 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 (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|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-25 18:20:36,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:20:36,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-25 18:20:36,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-25 18:20:36,435 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-25 18:20:37,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:20:37,577 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-25 18:20:37,580 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-25 18:20:37,588 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-25 18:20:37,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:20:37,599 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-25 18:20:37,605 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-25 18:20:37,612 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-25 18:20:46,325 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-25 18:20:46,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:46,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:20:46,381 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-25 18:20:46,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:46,393 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-25 18:20:46,404 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-25 18:20:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:46,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405292910] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:46,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:20:46,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [20, 17] total 43 [2022-11-25 18:20:46,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6370329] [2022-11-25 18:20:46,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:46,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 18:20:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:46,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 18:20:46,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1342, Unknown=54, NotChecked=158, Total=1806 [2022-11-25 18:20:46,574 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-25 18:20:53,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 18:20:55,108 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 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (not (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| 1) |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 0))) (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-25 18:21:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:00,409 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2022-11-25 18:21:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 18:21:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-25 18:21:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:00,411 INFO L225 Difference]: With dead ends: 199 [2022-11-25 18:21:00,411 INFO L226 Difference]: Without dead ends: 199 [2022-11-25 18:21:00,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=445, Invalid=3125, Unknown=102, NotChecked=360, Total=4032 [2022-11-25 18:21:00,414 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 227 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 35 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:00,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 692 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 955 Invalid, 26 Unknown, 344 Unchecked, 5.5s Time] [2022-11-25 18:21:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-25 18:21:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2022-11-25 18:21:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.280701754385965) internal successors, (146), 137 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-11-25 18:21:00,419 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 37 [2022-11-25 18:21:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:00,419 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-11-25 18:21:00,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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-25 18:21:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-11-25 18:21:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:21:00,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:00,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] [2022-11-25 18:21:00,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:00,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 18:21:00,628 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-25 18:21:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash 421565270, now seen corresponding path program 1 times [2022-11-25 18:21:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:00,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502214856] [2022-11-25 18:21:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:01,244 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-25 18:21:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:01,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502214856] [2022-11-25 18:21:01,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502214856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:01,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:01,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:21:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657648274] [2022-11-25 18:21:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:01,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:21:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:21:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:21:01,246 INFO L87 Difference]: Start difference. First operand 138 states and 146 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-25 18:21:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:02,108 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2022-11-25 18:21:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:21:02,109 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-25 18:21:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:02,110 INFO L225 Difference]: With dead ends: 202 [2022-11-25 18:21:02,110 INFO L226 Difference]: Without dead ends: 202 [2022-11-25 18:21:02,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:21:02,111 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 227 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:02,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 334 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:21:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-25 18:21:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2022-11-25 18:21:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2022-11-25 18:21:02,116 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 38 [2022-11-25 18:21:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:02,116 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2022-11-25 18:21:02,117 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-25 18:21:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-11-25 18:21:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:21:02,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:02,117 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-25 18:21:02,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 18:21:02,124 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-25 18:21:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash 183621750, now seen corresponding path program 1 times [2022-11-25 18:21:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:02,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436214504] [2022-11-25 18:21:02,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:02,698 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-25 18:21:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:02,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436214504] [2022-11-25 18:21:02,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436214504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:02,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:02,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:21:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306662416] [2022-11-25 18:21:02,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:21:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:21:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:21:02,700 INFO L87 Difference]: Start difference. First operand 147 states and 156 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-25 18:21:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:03,481 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2022-11-25 18:21:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:21:03,482 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-25 18:21:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:03,483 INFO L225 Difference]: With dead ends: 201 [2022-11-25 18:21:03,483 INFO L226 Difference]: Without dead ends: 201 [2022-11-25 18:21:03,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:21:03,484 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 161 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:03,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 315 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:21:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-25 18:21:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2022-11-25 18:21:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2022-11-25 18:21:03,488 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 39 [2022-11-25 18:21:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:03,489 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2022-11-25 18:21:03,489 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-25 18:21:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2022-11-25 18:21:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:21:03,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:03,490 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-25 18:21:03,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 18:21:03,490 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-25 18:21:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086814, now seen corresponding path program 1 times [2022-11-25 18:21:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:03,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496138330] [2022-11-25 18:21:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:04,281 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-25 18:21:04,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:04,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496138330] [2022-11-25 18:21:04,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496138330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:04,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282648443] [2022-11-25 18:21:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:04,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:04,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:04,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:21:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:04,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 18:21:04,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:04,636 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:21:04,636 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-25 18:21:04,694 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-25 18:21:04,873 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:21:04,874 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-25 18:21:04,971 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:21:04,971 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-25 18:21:05,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:21:05,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:05,756 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-25 18:21:05,792 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-25 18:21:05,798 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-25 18:21:05,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:21:05,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:05,912 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-25 18:21:06,239 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-25 18:21:06,472 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-25 18:21:06,510 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-25 18:21:06,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:06,574 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-25 18:21:06,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:06,591 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-25 18:21:06,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:06,617 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-25 18:21:06,633 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-25 18:21:06,800 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:21:06,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 1 [2022-11-25 18:21:07,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:07,145 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-25 18:21:07,528 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-25 18:21:07,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282648443] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:21:07,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:21:07,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2022-11-25 18:21:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323580466] [2022-11-25 18:21:07,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:21:07,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 18:21:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:07,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 18:21:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1231, Unknown=6, NotChecked=222, Total=1640 [2022-11-25 18:21:07,532 INFO L87 Difference]: Start difference. First operand 148 states and 157 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-25 18:21:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:10,286 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2022-11-25 18:21:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 18:21:10,287 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-25 18:21:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:10,288 INFO L225 Difference]: With dead ends: 200 [2022-11-25 18:21:10,288 INFO L226 Difference]: Without dead ends: 200 [2022-11-25 18:21:10,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=470, Invalid=2086, Unknown=6, NotChecked=300, Total=2862 [2022-11-25 18:21:10,290 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 683 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:10,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 871 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1500 Invalid, 0 Unknown, 550 Unchecked, 1.8s Time] [2022-11-25 18:21:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-25 18:21:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2022-11-25 18:21:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 153 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2022-11-25 18:21:10,297 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 39 [2022-11-25 18:21:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:10,297 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2022-11-25 18:21:10,297 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-25 18:21:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2022-11-25 18:21:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:21:10,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:10,298 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-25 18:21:10,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:10,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:10,512 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-25 18:21:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086815, now seen corresponding path program 1 times [2022-11-25 18:21:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047316232] [2022-11-25 18:21:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:10,922 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-25 18:21:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:10,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047316232] [2022-11-25 18:21:10,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047316232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:10,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126410223] [2022-11-25 18:21:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:10,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:10,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:21:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:11,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 18:21:11,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:11,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:21:11,629 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-25 18:21:11,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:21:11,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:11,640 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-25 18:21:11,673 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-25 18:21:11,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:21:11,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:11,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-11-25 18:21:11,932 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 18:21:11,933 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-25 18:21:11,951 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-25 18:21:11,951 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-25 18:21:12,132 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-25 18:21:12,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126410223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:21:12,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:21:12,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-11-25 18:21:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415702952] [2022-11-25 18:21:12,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:21:12,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:21:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:21:12,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:21:12,134 INFO L87 Difference]: Start difference. First operand 154 states and 164 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-25 18:21:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:13,787 INFO L93 Difference]: Finished difference Result 220 states and 225 transitions. [2022-11-25 18:21:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:21:13,787 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-25 18:21:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:13,788 INFO L225 Difference]: With dead ends: 220 [2022-11-25 18:21:13,789 INFO L226 Difference]: Without dead ends: 220 [2022-11-25 18:21:13,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2022-11-25 18:21:13,790 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 478 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:13,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 529 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 18:21:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-25 18:21:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2022-11-25 18:21:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2022-11-25 18:21:13,796 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 39 [2022-11-25 18:21:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:13,796 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2022-11-25 18:21:13,797 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-25 18:21:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2022-11-25 18:21:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:21:13,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:13,798 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-25 18:21:13,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:14,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 18:21:14,005 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-25 18:21:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1397307224, now seen corresponding path program 1 times [2022-11-25 18:21:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:14,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912929605] [2022-11-25 18:21:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,240 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-25 18:21:14,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:14,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912929605] [2022-11-25 18:21:14,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912929605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:14,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:14,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:21:14,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815729288] [2022-11-25 18:21:14,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:14,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:21:14,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:21:14,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:21:14,242 INFO L87 Difference]: Start difference. First operand 164 states and 178 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-25 18:21:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:14,747 INFO L93 Difference]: Finished difference Result 192 states and 199 transitions. [2022-11-25 18:21:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:14,748 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-25 18:21:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:14,749 INFO L225 Difference]: With dead ends: 192 [2022-11-25 18:21:14,749 INFO L226 Difference]: Without dead ends: 192 [2022-11-25 18:21:14,750 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-25 18:21:14,750 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 88 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:14,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 290 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:21:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-25 18:21:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2022-11-25 18:21:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 170 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:21:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2022-11-25 18:21:14,756 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 40 [2022-11-25 18:21:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:14,756 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2022-11-25 18:21:14,756 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-25 18:21:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2022-11-25 18:21:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:21:14,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:14,757 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-25 18:21:14,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 18:21:14,757 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-25 18:21:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 402357860, now seen corresponding path program 1 times [2022-11-25 18:21:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:14,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163643914] [2022-11-25 18:21:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,856 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-25 18:21:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:16,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163643914] [2022-11-25 18:21:16,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163643914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:16,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888210877] [2022-11-25 18:21:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:16,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:16,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:16,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46a4df73-fad1-44eb-b3ac-cc9acb5370fd/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:21:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:17,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 18:21:17,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:17,073 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-25 18:21:17,224 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:21:17,225 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-25 18:21:17,292 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-25 18:21:17,479 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:21:17,479 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-25 18:21:17,665 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:21:17,665 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-25 18:21:17,813 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 18:21:17,813 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-25 18:21:17,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:21:17,851 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:21:17,851 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-25 18:21:17,945 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 18:21:17,945 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-25 18:21:18,161 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-25 18:21:18,161 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-25 18:21:18,330 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 18:21:18,331 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-25 18:21:18,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:21:18,639 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-25 18:21:18,644 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-25 18:21:18,653 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-25 18:21:18,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:21:19,454 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-11-25 18:21:19,455 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-25 18:21:19,471 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-25 18:21:19,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:19,605 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-25 18:21:19,626 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-25 18:21:20,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:20,459 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-25 18:21:20,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:20,490 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-25 18:21:20,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:20,678 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-25 18:21:20,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:20,750 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-25 18:21:20,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:20,830 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-25 18:21:20,900 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-25 18:21:21,076 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-11-25 18:21:21,076 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