./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8 --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 e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 --- 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-2329fc7 [2022-12-13 14:10:28,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:10:28,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:10:28,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:10:28,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:10:28,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:10:28,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:10:28,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:10:28,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:10:28,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:10:28,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:10:28,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:10:28,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:10:28,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:10:28,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:10:28,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:10:28,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:10:28,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:10:28,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:10:28,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:10:28,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:10:28,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:10:28,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:10:28,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:10:28,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:10:28,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:10:28,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:10:28,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:10:28,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:10:28,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:10:28,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:10:28,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:10:28,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:10:28,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:10:28,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:10:28,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:10:28,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:10:28,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:10:28,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:10:28,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:10:28,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:10:28,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 14:10:28,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:10:28,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:10:28,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:10:28,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:10:28,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:10:28,270 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:10:28,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:10:28,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:10:28,271 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:10:28,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:10:28,272 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:10:28,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:10:28,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:10:28,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:10:28,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:10:28,272 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:10:28,273 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:10:28,273 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:10:28,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:10:28,273 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:10:28,273 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:10:28,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:10:28,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:10:28,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:10:28,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:10:28,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:10:28,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:10:28,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:10:28,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:10:28,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:10:28,275 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:10:28,275 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:10:28,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:10:28,275 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:10:28,275 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_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/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_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8 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 -> e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 [2022-12-13 14:10:28,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:10:28,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:10:28,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:10:28,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:10:28,493 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:10:28,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2022-12-13 14:10:31,096 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:10:31,278 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:10:31,279 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2022-12-13 14:10:31,287 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/data/2e60b8846/9bd9cfbdab6641da98b016f55a32fc2d/FLAG5a155f180 [2022-12-13 14:10:31,298 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/data/2e60b8846/9bd9cfbdab6641da98b016f55a32fc2d [2022-12-13 14:10:31,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:10:31,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:10:31,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:10:31,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:10:31,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:10:31,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734643d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31, skipping insertion in model container [2022-12-13 14:10:31,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:10:31,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:10:31,626 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_a83f45eb-57fa-4bce-89dd-bfe2de725e91/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c[38357,38370] [2022-12-13 14:10:31,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:10:31,667 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:10:31,783 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_a83f45eb-57fa-4bce-89dd-bfe2de725e91/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c[38357,38370] [2022-12-13 14:10:31,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:10:31,809 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:10:31,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31 WrapperNode [2022-12-13 14:10:31,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:10:31,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:10:31,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:10:31,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:10:31,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,873 INFO L138 Inliner]: procedures = 17, calls = 620, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2158 [2022-12-13 14:10:31,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:10:31,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:10:31,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:10:31,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:10:31,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,922 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:10:31,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:10:31,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:10:31,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:10:31,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (1/1) ... [2022-12-13 14:10:31,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:10:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:10:31,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:10:31,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:10:31,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:10:31,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:10:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:10:32,130 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:10:32,132 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:10:33,226 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:10:33,240 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:10:33,241 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:10:33,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:10:33 BoogieIcfgContainer [2022-12-13 14:10:33,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:10:33,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:10:33,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:10:33,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:10:33,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:10:31" (1/3) ... [2022-12-13 14:10:33,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f6e2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:10:33, skipping insertion in model container [2022-12-13 14:10:33,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:10:31" (2/3) ... [2022-12-13 14:10:33,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f6e2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:10:33, skipping insertion in model container [2022-12-13 14:10:33,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:10:33" (3/3) ... [2022-12-13 14:10:33,253 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+nlh-reducer.c [2022-12-13 14:10:33,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:10:33,272 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 168 error locations. [2022-12-13 14:10:33,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:10:33,333 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;@6242fc73, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:10:33,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 168 error locations. [2022-12-13 14:10:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 301 states have (on average 2.129568106312292) internal successors, (641), 469 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 14:10:33,345 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:33,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 14:10:33,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 926754, now seen corresponding path program 1 times [2022-12-13 14:10:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:33,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254217942] [2022-12-13 14:10:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254217942] [2022-12-13 14:10:33,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254217942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:33,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:33,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523369731] [2022-12-13 14:10:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:33,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:33,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:33,661 INFO L87 Difference]: Start difference. First operand has 470 states, 301 states have (on average 2.129568106312292) internal successors, (641), 469 states have internal predecessors, (641), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:34,143 INFO L93 Difference]: Finished difference Result 471 states and 598 transitions. [2022-12-13 14:10:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:34,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 14:10:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:34,157 INFO L225 Difference]: With dead ends: 471 [2022-12-13 14:10:34,157 INFO L226 Difference]: Without dead ends: 468 [2022-12-13 14:10:34,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:34,162 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 166 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:34,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1021 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-12-13 14:10:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-12-13 14:10:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.98) internal successors, (594), 467 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 594 transitions. [2022-12-13 14:10:34,207 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 594 transitions. Word has length 4 [2022-12-13 14:10:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:34,207 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 594 transitions. [2022-12-13 14:10:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 594 transitions. [2022-12-13 14:10:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 14:10:34,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:34,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 14:10:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:10:34,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-12-13 14:10:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:34,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537306028] [2022-12-13 14:10:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:34,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537306028] [2022-12-13 14:10:34,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537306028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:34,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:34,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305876313] [2022-12-13 14:10:34,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:34,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:34,273 INFO L87 Difference]: Start difference. First operand 468 states and 594 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:34,694 INFO L93 Difference]: Finished difference Result 427 states and 553 transitions. [2022-12-13 14:10:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:34,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 14:10:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:34,697 INFO L225 Difference]: With dead ends: 427 [2022-12-13 14:10:34,697 INFO L226 Difference]: Without dead ends: 427 [2022-12-13 14:10:34,697 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-12-13 14:10:34,699 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 841 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:34,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 257 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-12-13 14:10:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-12-13 14:10:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 300 states have (on average 1.8433333333333333) internal successors, (553), 426 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 553 transitions. [2022-12-13 14:10:34,714 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 553 transitions. Word has length 4 [2022-12-13 14:10:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:34,715 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 553 transitions. [2022-12-13 14:10:34,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 553 transitions. [2022-12-13 14:10:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 14:10:34,715 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:34,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 14:10:34,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:10:34,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:34,717 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-12-13 14:10:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:34,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690905557] [2022-12-13 14:10:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:34,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:34,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690905557] [2022-12-13 14:10:34,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690905557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:34,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:34,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667702040] [2022-12-13 14:10:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:34,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:34,837 INFO L87 Difference]: Start difference. First operand 427 states and 553 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:35,178 INFO L93 Difference]: Finished difference Result 386 states and 512 transitions. [2022-12-13 14:10:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-13 14:10:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:35,180 INFO L225 Difference]: With dead ends: 386 [2022-12-13 14:10:35,180 INFO L226 Difference]: Without dead ends: 386 [2022-12-13 14:10:35,180 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-12-13 14:10:35,181 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 888 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:35,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 258 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-13 14:10:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-12-13 14:10:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 385 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 512 transitions. [2022-12-13 14:10:35,191 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 512 transitions. Word has length 4 [2022-12-13 14:10:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:35,191 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 512 transitions. [2022-12-13 14:10:35,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 512 transitions. [2022-12-13 14:10:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 14:10:35,193 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:35,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:35,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:10:35,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash 619918515, now seen corresponding path program 1 times [2022-12-13 14:10:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:35,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316239606] [2022-12-13 14:10:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:35,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316239606] [2022-12-13 14:10:35,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316239606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:35,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090951508] [2022-12-13 14:10:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:35,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:10:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:35,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:10:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:10:35,520 INFO L87 Difference]: Start difference. First operand 386 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:35,696 INFO L93 Difference]: Finished difference Result 388 states and 512 transitions. [2022-12-13 14:10:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:10:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-12-13 14:10:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:35,698 INFO L225 Difference]: With dead ends: 388 [2022-12-13 14:10:35,698 INFO L226 Difference]: Without dead ends: 388 [2022-12-13 14:10:35,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-13 14:10:35,699 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 91 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:35,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 760 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-12-13 14:10:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2022-12-13 14:10:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7033333333333334) internal successors, (511), 385 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2022-12-13 14:10:35,705 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 88 [2022-12-13 14:10:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:35,706 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2022-12-13 14:10:35,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2022-12-13 14:10:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 14:10:35,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:35,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:35,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:10:35,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:35,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:35,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2036638706, now seen corresponding path program 1 times [2022-12-13 14:10:35,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:35,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042367397] [2022-12-13 14:10:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042367397] [2022-12-13 14:10:35,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042367397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:35,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:35,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784738312] [2022-12-13 14:10:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:35,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:10:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:10:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:10:35,901 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:35,911 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2022-12-13 14:10:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:10:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-13 14:10:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:35,914 INFO L225 Difference]: With dead ends: 386 [2022-12-13 14:10:35,914 INFO L226 Difference]: Without dead ends: 386 [2022-12-13 14:10:35,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-13 14:10:35,915 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 423 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:35,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 594 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:10:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-13 14:10:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-12-13 14:10:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7) internal successors, (510), 385 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-12-13 14:10:35,924 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 89 [2022-12-13 14:10:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:35,925 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-12-13 14:10:35,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-12-13 14:10:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 14:10:35,926 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:35,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:35,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:10:35,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637796, now seen corresponding path program 1 times [2022-12-13 14:10:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:35,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774259182] [2022-12-13 14:10:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:36,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774259182] [2022-12-13 14:10:36,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774259182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:36,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:36,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726566550] [2022-12-13 14:10:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:36,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:36,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:36,129 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:36,520 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-12-13 14:10:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-13 14:10:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:36,522 INFO L225 Difference]: With dead ends: 385 [2022-12-13 14:10:36,522 INFO L226 Difference]: Without dead ends: 385 [2022-12-13 14:10:36,522 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-12-13 14:10:36,523 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 589 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:36,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 341 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-12-13 14:10:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2022-12-13 14:10:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 300 states have (on average 1.6966666666666668) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-12-13 14:10:36,529 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 89 [2022-12-13 14:10:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:36,530 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-12-13 14:10:36,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-12-13 14:10:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 14:10:36,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:36,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:36,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:10:36,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637797, now seen corresponding path program 1 times [2022-12-13 14:10:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:36,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245287384] [2022-12-13 14:10:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245287384] [2022-12-13 14:10:36,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245287384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:36,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:36,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515409630] [2022-12-13 14:10:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:36,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:36,855 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:37,528 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2022-12-13 14:10:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:10:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-13 14:10:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:37,530 INFO L225 Difference]: With dead ends: 384 [2022-12-13 14:10:37,530 INFO L226 Difference]: Without dead ends: 384 [2022-12-13 14:10:37,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:10:37,531 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 882 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:37,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 426 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 14:10:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-12-13 14:10:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-12-13 14:10:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 383 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2022-12-13 14:10:37,539 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 89 [2022-12-13 14:10:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:37,540 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2022-12-13 14:10:37,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:37,540 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2022-12-13 14:10:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 14:10:37,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:37,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:37,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:10:37,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1296129175, now seen corresponding path program 1 times [2022-12-13 14:10:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:37,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260515849] [2022-12-13 14:10:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:38,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:38,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260515849] [2022-12-13 14:10:38,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260515849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:38,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:38,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:10:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221213826] [2022-12-13 14:10:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:38,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:10:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:10:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:10:38,159 INFO L87 Difference]: Start difference. First operand 384 states and 508 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:38,879 INFO L93 Difference]: Finished difference Result 383 states and 507 transitions. [2022-12-13 14:10:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:10:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-12-13 14:10:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:38,882 INFO L225 Difference]: With dead ends: 383 [2022-12-13 14:10:38,882 INFO L226 Difference]: Without dead ends: 382 [2022-12-13 14:10:38,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:10:38,883 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 294 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:38,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 675 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 14:10:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-12-13 14:10:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-12-13 14:10:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 299 states have (on average 1.274247491638796) internal successors, (381), 381 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 381 transitions. [2022-12-13 14:10:38,893 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 381 transitions. Word has length 91 [2022-12-13 14:10:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:38,893 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 381 transitions. [2022-12-13 14:10:38,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 381 transitions. [2022-12-13 14:10:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-13 14:10:38,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:38,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:38,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:10:38,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:38,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:38,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244098, now seen corresponding path program 1 times [2022-12-13 14:10:38,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:38,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606660876] [2022-12-13 14:10:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:39,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606660876] [2022-12-13 14:10:39,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606660876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:39,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:39,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:39,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828668351] [2022-12-13 14:10:39,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:39,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:39,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:39,078 INFO L87 Difference]: Start difference. First operand 382 states and 381 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:39,272 INFO L93 Difference]: Finished difference Result 381 states and 380 transitions. [2022-12-13 14:10:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-12-13 14:10:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:39,275 INFO L225 Difference]: With dead ends: 381 [2022-12-13 14:10:39,275 INFO L226 Difference]: Without dead ends: 381 [2022-12-13 14:10:39,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:39,276 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 870 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:39,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 426 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-12-13 14:10:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-12-13 14:10:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 299 states have (on average 1.2709030100334449) internal successors, (380), 380 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 380 transitions. [2022-12-13 14:10:39,283 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 380 transitions. Word has length 94 [2022-12-13 14:10:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:39,284 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 380 transitions. [2022-12-13 14:10:39,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 380 transitions. [2022-12-13 14:10:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-13 14:10:39,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:39,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:10:39,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244097, now seen corresponding path program 1 times [2022-12-13 14:10:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:39,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998101218] [2022-12-13 14:10:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:39,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998101218] [2022-12-13 14:10:39,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998101218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:39,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:39,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887880605] [2022-12-13 14:10:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:39,599 INFO L87 Difference]: Start difference. First operand 381 states and 380 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:40,038 INFO L93 Difference]: Finished difference Result 380 states and 379 transitions. [2022-12-13 14:10:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:10:40,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-12-13 14:10:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:40,040 INFO L225 Difference]: With dead ends: 380 [2022-12-13 14:10:40,040 INFO L226 Difference]: Without dead ends: 380 [2022-12-13 14:10:40,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:10:40,041 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 740 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:40,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 424 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-12-13 14:10:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-12-13 14:10:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 299 states have (on average 1.2675585284280937) internal successors, (379), 379 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 379 transitions. [2022-12-13 14:10:40,053 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 379 transitions. Word has length 94 [2022-12-13 14:10:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:40,053 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 379 transitions. [2022-12-13 14:10:40,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 379 transitions. [2022-12-13 14:10:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 14:10:40,054 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:40,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:40,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:10:40,054 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -837057419, now seen corresponding path program 1 times [2022-12-13 14:10:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463949655] [2022-12-13 14:10:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:40,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463949655] [2022-12-13 14:10:40,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463949655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:40,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:40,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212265895] [2022-12-13 14:10:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:40,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:40,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:40,207 INFO L87 Difference]: Start difference. First operand 380 states and 379 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 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-12-13 14:10:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:40,395 INFO L93 Difference]: Finished difference Result 379 states and 378 transitions. [2022-12-13 14:10:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 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 99 [2022-12-13 14:10:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:40,397 INFO L225 Difference]: With dead ends: 379 [2022-12-13 14:10:40,397 INFO L226 Difference]: Without dead ends: 379 [2022-12-13 14:10:40,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:40,398 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 854 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:40,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 428 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-12-13 14:10:40,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2022-12-13 14:10:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 299 states have (on average 1.2642140468227425) internal successors, (378), 378 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 378 transitions. [2022-12-13 14:10:40,404 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 378 transitions. Word has length 99 [2022-12-13 14:10:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:40,404 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 378 transitions. [2022-12-13 14:10:40,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 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-12-13 14:10:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 378 transitions. [2022-12-13 14:10:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 14:10:40,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:40,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:40,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:10:40,406 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash -837057418, now seen corresponding path program 1 times [2022-12-13 14:10:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255362718] [2022-12-13 14:10:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:40,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255362718] [2022-12-13 14:10:40,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255362718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:40,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:40,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421631085] [2022-12-13 14:10:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:40,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:40,799 INFO L87 Difference]: Start difference. First operand 379 states and 378 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 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-12-13 14:10:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:41,242 INFO L93 Difference]: Finished difference Result 378 states and 377 transitions. [2022-12-13 14:10:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 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 99 [2022-12-13 14:10:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:41,244 INFO L225 Difference]: With dead ends: 378 [2022-12-13 14:10:41,244 INFO L226 Difference]: Without dead ends: 378 [2022-12-13 14:10:41,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:41,244 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1008 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:41,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 429 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-12-13 14:10:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-12-13 14:10:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 377 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 377 transitions. [2022-12-13 14:10:41,249 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 377 transitions. Word has length 99 [2022-12-13 14:10:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:41,249 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 377 transitions. [2022-12-13 14:10:41,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 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-12-13 14:10:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 377 transitions. [2022-12-13 14:10:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 14:10:41,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:41,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:41,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 14:10:41,250 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -586464657, now seen corresponding path program 1 times [2022-12-13 14:10:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:41,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97714762] [2022-12-13 14:10:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:41,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:41,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97714762] [2022-12-13 14:10:41,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97714762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:41,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:41,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018898471] [2022-12-13 14:10:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:41,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:41,383 INFO L87 Difference]: Start difference. First operand 378 states and 377 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:41,568 INFO L93 Difference]: Finished difference Result 377 states and 376 transitions. [2022-12-13 14:10:41,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:41,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-12-13 14:10:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:41,570 INFO L225 Difference]: With dead ends: 377 [2022-12-13 14:10:41,570 INFO L226 Difference]: Without dead ends: 377 [2022-12-13 14:10:41,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:41,571 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 838 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:41,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 430 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-12-13 14:10:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-12-13 14:10:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 299 states have (on average 1.2575250836120402) internal successors, (376), 376 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 376 transitions. [2022-12-13 14:10:41,577 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 376 transitions. Word has length 104 [2022-12-13 14:10:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:41,578 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 376 transitions. [2022-12-13 14:10:41,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 376 transitions. [2022-12-13 14:10:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 14:10:41,579 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:41,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:41,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:10:41,579 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash -586464656, now seen corresponding path program 1 times [2022-12-13 14:10:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616057754] [2022-12-13 14:10:41,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:41,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:41,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616057754] [2022-12-13 14:10:41,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616057754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:41,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:41,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428383642] [2022-12-13 14:10:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:41,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:41,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:41,968 INFO L87 Difference]: Start difference. First operand 377 states and 376 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:42,440 INFO L93 Difference]: Finished difference Result 376 states and 375 transitions. [2022-12-13 14:10:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:42,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-12-13 14:10:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:42,441 INFO L225 Difference]: With dead ends: 376 [2022-12-13 14:10:42,441 INFO L226 Difference]: Without dead ends: 376 [2022-12-13 14:10:42,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:42,442 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 998 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:42,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 472 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-12-13 14:10:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-12-13 14:10:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 299 states have (on average 1.254180602006689) internal successors, (375), 375 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 375 transitions. [2022-12-13 14:10:42,450 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 375 transitions. Word has length 104 [2022-12-13 14:10:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:42,451 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 375 transitions. [2022-12-13 14:10:42,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 375 transitions. [2022-12-13 14:10:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-13 14:10:42,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:42,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:42,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:10:42,452 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -84099962, now seen corresponding path program 1 times [2022-12-13 14:10:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:42,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11504672] [2022-12-13 14:10:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:42,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:42,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11504672] [2022-12-13 14:10:42,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11504672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:42,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:42,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986702667] [2022-12-13 14:10:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:42,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:42,598 INFO L87 Difference]: Start difference. First operand 376 states and 375 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:42,786 INFO L93 Difference]: Finished difference Result 375 states and 374 transitions. [2022-12-13 14:10:42,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:42,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-12-13 14:10:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:42,789 INFO L225 Difference]: With dead ends: 375 [2022-12-13 14:10:42,789 INFO L226 Difference]: Without dead ends: 375 [2022-12-13 14:10:42,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:42,790 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 822 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:42,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 432 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-12-13 14:10:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2022-12-13 14:10:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 374 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 374 transitions. [2022-12-13 14:10:42,794 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 374 transitions. Word has length 109 [2022-12-13 14:10:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:42,794 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 374 transitions. [2022-12-13 14:10:42,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 374 transitions. [2022-12-13 14:10:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-13 14:10:42,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:42,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 14:10:42,795 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:42,795 INFO L85 PathProgramCache]: Analyzing trace with hash -84099961, now seen corresponding path program 1 times [2022-12-13 14:10:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:42,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388171063] [2022-12-13 14:10:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388171063] [2022-12-13 14:10:43,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388171063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:43,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:43,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266243449] [2022-12-13 14:10:43,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:43,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:43,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:43,120 INFO L87 Difference]: Start difference. First operand 375 states and 374 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:43,612 INFO L93 Difference]: Finished difference Result 374 states and 373 transitions. [2022-12-13 14:10:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:43,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-12-13 14:10:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:43,613 INFO L225 Difference]: With dead ends: 374 [2022-12-13 14:10:43,613 INFO L226 Difference]: Without dead ends: 374 [2022-12-13 14:10:43,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:43,613 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1252 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:43,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 433 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-12-13 14:10:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-12-13 14:10:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 373 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 373 transitions. [2022-12-13 14:10:43,617 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 373 transitions. Word has length 109 [2022-12-13 14:10:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:43,617 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 373 transitions. [2022-12-13 14:10:43,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 373 transitions. [2022-12-13 14:10:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-13 14:10:43,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:43,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:43,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 14:10:43,618 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073504, now seen corresponding path program 1 times [2022-12-13 14:10:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:43,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646948636] [2022-12-13 14:10:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646948636] [2022-12-13 14:10:43,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646948636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:43,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:43,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915803819] [2022-12-13 14:10:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:43,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:43,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:43,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:43,758 INFO L87 Difference]: Start difference. First operand 374 states and 373 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:43,948 INFO L93 Difference]: Finished difference Result 373 states and 372 transitions. [2022-12-13 14:10:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-12-13 14:10:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:43,950 INFO L225 Difference]: With dead ends: 373 [2022-12-13 14:10:43,950 INFO L226 Difference]: Without dead ends: 373 [2022-12-13 14:10:43,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:43,951 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 806 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:43,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 434 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-12-13 14:10:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2022-12-13 14:10:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 299 states have (on average 1.2441471571906355) internal successors, (372), 372 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 372 transitions. [2022-12-13 14:10:43,959 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 372 transitions. Word has length 114 [2022-12-13 14:10:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:43,959 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 372 transitions. [2022-12-13 14:10:43,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 372 transitions. [2022-12-13 14:10:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-13 14:10:43,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:43,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:43,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 14:10:43,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073505, now seen corresponding path program 1 times [2022-12-13 14:10:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315296847] [2022-12-13 14:10:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315296847] [2022-12-13 14:10:44,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315296847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:44,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:44,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667409928] [2022-12-13 14:10:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:44,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:44,291 INFO L87 Difference]: Start difference. First operand 373 states and 372 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:44,741 INFO L93 Difference]: Finished difference Result 372 states and 371 transitions. [2022-12-13 14:10:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-12-13 14:10:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:44,743 INFO L225 Difference]: With dead ends: 372 [2022-12-13 14:10:44,743 INFO L226 Difference]: Without dead ends: 372 [2022-12-13 14:10:44,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:44,743 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 694 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:44,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 476 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-12-13 14:10:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2022-12-13 14:10:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 299 states have (on average 1.2408026755852843) internal successors, (371), 371 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 371 transitions. [2022-12-13 14:10:44,747 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 371 transitions. Word has length 114 [2022-12-13 14:10:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:44,747 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 371 transitions. [2022-12-13 14:10:44,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 371 transitions. [2022-12-13 14:10:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 14:10:44,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:44,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:44,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 14:10:44,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157079, now seen corresponding path program 1 times [2022-12-13 14:10:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:44,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145382334] [2022-12-13 14:10:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:44,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:44,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145382334] [2022-12-13 14:10:44,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145382334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:44,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:44,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78635241] [2022-12-13 14:10:44,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:44,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:44,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:44,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:44,956 INFO L87 Difference]: Start difference. First operand 372 states and 371 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:45,134 INFO L93 Difference]: Finished difference Result 371 states and 370 transitions. [2022-12-13 14:10:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:45,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2022-12-13 14:10:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:45,136 INFO L225 Difference]: With dead ends: 371 [2022-12-13 14:10:45,137 INFO L226 Difference]: Without dead ends: 371 [2022-12-13 14:10:45,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:45,137 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 790 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:45,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-12-13 14:10:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2022-12-13 14:10:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 299 states have (on average 1.2374581939799332) internal successors, (370), 370 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 370 transitions. [2022-12-13 14:10:45,143 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 370 transitions. Word has length 119 [2022-12-13 14:10:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:45,143 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 370 transitions. [2022-12-13 14:10:45,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 370 transitions. [2022-12-13 14:10:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-13 14:10:45,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:45,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:45,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 14:10:45,145 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157080, now seen corresponding path program 1 times [2022-12-13 14:10:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:45,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112323962] [2022-12-13 14:10:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112323962] [2022-12-13 14:10:45,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112323962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:45,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:45,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560149103] [2022-12-13 14:10:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:45,504 INFO L87 Difference]: Start difference. First operand 371 states and 370 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:45,935 INFO L93 Difference]: Finished difference Result 370 states and 369 transitions. [2022-12-13 14:10:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2022-12-13 14:10:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:45,937 INFO L225 Difference]: With dead ends: 370 [2022-12-13 14:10:45,937 INFO L226 Difference]: Without dead ends: 370 [2022-12-13 14:10:45,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:45,937 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 936 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:45,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 437 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:10:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-12-13 14:10:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-12-13 14:10:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.234113712374582) internal successors, (369), 369 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 369 transitions. [2022-12-13 14:10:45,942 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 369 transitions. Word has length 119 [2022-12-13 14:10:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:45,943 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 369 transitions. [2022-12-13 14:10:45,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 369 transitions. [2022-12-13 14:10:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-13 14:10:45,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:45,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:45,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 14:10:45,944 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash 345305810, now seen corresponding path program 1 times [2022-12-13 14:10:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:45,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918294454] [2022-12-13 14:10:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:46,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:46,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918294454] [2022-12-13 14:10:46,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918294454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:46,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:46,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193206745] [2022-12-13 14:10:46,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:46,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:46,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:46,367 INFO L87 Difference]: Start difference. First operand 370 states and 369 transitions. Second operand has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:46,710 INFO L93 Difference]: Finished difference Result 369 states and 368 transitions. [2022-12-13 14:10:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-12-13 14:10:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:46,711 INFO L225 Difference]: With dead ends: 369 [2022-12-13 14:10:46,711 INFO L226 Difference]: Without dead ends: 369 [2022-12-13 14:10:46,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:46,712 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 675 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:46,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 480 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-12-13 14:10:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-12-13 14:10:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 299 states have (on average 1.2307692307692308) internal successors, (368), 368 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 368 transitions. [2022-12-13 14:10:46,717 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 368 transitions. Word has length 124 [2022-12-13 14:10:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:46,718 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 368 transitions. [2022-12-13 14:10:46,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 368 transitions. [2022-12-13 14:10:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-13 14:10:46,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:46,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:46,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 14:10:46,719 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash 345305809, now seen corresponding path program 1 times [2022-12-13 14:10:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:46,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135377242] [2022-12-13 14:10:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:46,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135377242] [2022-12-13 14:10:46,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135377242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:46,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:46,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:10:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860610050] [2022-12-13 14:10:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:46,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:10:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:46,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:10:46,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:10:46,896 INFO L87 Difference]: Start difference. First operand 369 states and 368 transitions. Second operand has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:47,083 INFO L93 Difference]: Finished difference Result 368 states and 367 transitions. [2022-12-13 14:10:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:10:47,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-12-13 14:10:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:47,084 INFO L225 Difference]: With dead ends: 368 [2022-12-13 14:10:47,084 INFO L226 Difference]: Without dead ends: 368 [2022-12-13 14:10:47,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:47,085 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 771 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:47,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-12-13 14:10:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-12-13 14:10:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 299 states have (on average 1.2274247491638797) internal successors, (367), 367 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 367 transitions. [2022-12-13 14:10:47,090 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 367 transitions. Word has length 124 [2022-12-13 14:10:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:47,090 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 367 transitions. [2022-12-13 14:10:47,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 367 transitions. [2022-12-13 14:10:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 14:10:47,091 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:47,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:47,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 14:10:47,092 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 286927016, now seen corresponding path program 1 times [2022-12-13 14:10:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:47,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185240902] [2022-12-13 14:10:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:47,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185240902] [2022-12-13 14:10:47,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185240902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:47,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:47,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:47,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072384821] [2022-12-13 14:10:47,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:47,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:47,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:47,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:47,257 INFO L87 Difference]: Start difference. First operand 368 states and 367 transitions. Second operand has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 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-12-13 14:10:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:47,394 INFO L93 Difference]: Finished difference Result 367 states and 366 transitions. [2022-12-13 14:10:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-12-13 14:10:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:47,396 INFO L225 Difference]: With dead ends: 367 [2022-12-13 14:10:47,396 INFO L226 Difference]: Without dead ends: 367 [2022-12-13 14:10:47,397 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-12-13 14:10:47,397 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 477 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:47,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 355 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-12-13 14:10:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-12-13 14:10:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 299 states have (on average 1.2240802675585285) internal successors, (366), 366 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 366 transitions. [2022-12-13 14:10:47,401 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 366 transitions. Word has length 129 [2022-12-13 14:10:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:47,402 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 366 transitions. [2022-12-13 14:10:47,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 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-12-13 14:10:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 366 transitions. [2022-12-13 14:10:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 14:10:47,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:47,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:47,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 14:10:47,402 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 286927017, now seen corresponding path program 1 times [2022-12-13 14:10:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:47,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151364606] [2022-12-13 14:10:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151364606] [2022-12-13 14:10:47,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151364606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:47,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:47,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309797076] [2022-12-13 14:10:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:47,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:47,731 INFO L87 Difference]: Start difference. First operand 367 states and 366 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 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-12-13 14:10:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:48,117 INFO L93 Difference]: Finished difference Result 366 states and 365 transitions. [2022-12-13 14:10:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-12-13 14:10:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:48,119 INFO L225 Difference]: With dead ends: 366 [2022-12-13 14:10:48,119 INFO L226 Difference]: Without dead ends: 366 [2022-12-13 14:10:48,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:48,120 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 661 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:48,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 482 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-12-13 14:10:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-12-13 14:10:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 299 states have (on average 1.2207357859531773) internal successors, (365), 365 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 365 transitions. [2022-12-13 14:10:48,123 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 365 transitions. Word has length 129 [2022-12-13 14:10:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:48,123 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 365 transitions. [2022-12-13 14:10:48,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 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-12-13 14:10:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 365 transitions. [2022-12-13 14:10:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 14:10:48,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:48,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:48,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 14:10:48,124 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 6786306, now seen corresponding path program 1 times [2022-12-13 14:10:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331733329] [2022-12-13 14:10:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:48,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331733329] [2022-12-13 14:10:48,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331733329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:48,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:48,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822116902] [2022-12-13 14:10:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:48,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:48,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:48,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:48,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:48,319 INFO L87 Difference]: Start difference. First operand 366 states and 365 transitions. Second operand has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:48,477 INFO L93 Difference]: Finished difference Result 365 states and 364 transitions. [2022-12-13 14:10:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-12-13 14:10:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:48,479 INFO L225 Difference]: With dead ends: 365 [2022-12-13 14:10:48,479 INFO L226 Difference]: Without dead ends: 365 [2022-12-13 14:10:48,479 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-12-13 14:10:48,480 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 463 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:48,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 357 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-13 14:10:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-12-13 14:10:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 299 states have (on average 1.2173913043478262) internal successors, (364), 364 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 364 transitions. [2022-12-13 14:10:48,485 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 364 transitions. Word has length 134 [2022-12-13 14:10:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:48,485 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 364 transitions. [2022-12-13 14:10:48,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 364 transitions. [2022-12-13 14:10:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 14:10:48,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:48,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:48,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 14:10:48,486 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash 6786307, now seen corresponding path program 1 times [2022-12-13 14:10:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:48,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120073739] [2022-12-13 14:10:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:48,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120073739] [2022-12-13 14:10:48,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120073739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:48,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:48,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018272817] [2022-12-13 14:10:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:48,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:48,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:48,873 INFO L87 Difference]: Start difference. First operand 365 states and 364 transitions. Second operand has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:49,239 INFO L93 Difference]: Finished difference Result 364 states and 363 transitions. [2022-12-13 14:10:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:49,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-12-13 14:10:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:49,240 INFO L225 Difference]: With dead ends: 364 [2022-12-13 14:10:49,240 INFO L226 Difference]: Without dead ends: 364 [2022-12-13 14:10:49,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:49,240 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 920 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:49,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 484 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-12-13 14:10:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-12-13 14:10:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 299 states have (on average 1.214046822742475) internal successors, (363), 363 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 363 transitions. [2022-12-13 14:10:49,243 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 363 transitions. Word has length 134 [2022-12-13 14:10:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:49,244 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 363 transitions. [2022-12-13 14:10:49,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 363 transitions. [2022-12-13 14:10:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 14:10:49,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:49,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:49,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 14:10:49,244 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash -664511303, now seen corresponding path program 1 times [2022-12-13 14:10:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:49,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005394169] [2022-12-13 14:10:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:49,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:49,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005394169] [2022-12-13 14:10:49,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005394169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:49,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:49,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725024749] [2022-12-13 14:10:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:49,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:49,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:49,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:49,378 INFO L87 Difference]: Start difference. First operand 364 states and 363 transitions. Second operand has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:49,522 INFO L93 Difference]: Finished difference Result 363 states and 362 transitions. [2022-12-13 14:10:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-12-13 14:10:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:49,524 INFO L225 Difference]: With dead ends: 363 [2022-12-13 14:10:49,524 INFO L226 Difference]: Without dead ends: 363 [2022-12-13 14:10:49,524 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-12-13 14:10:49,525 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 449 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:49,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 359 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-12-13 14:10:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-12-13 14:10:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 299 states have (on average 1.2107023411371238) internal successors, (362), 362 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 362 transitions. [2022-12-13 14:10:49,528 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 362 transitions. Word has length 139 [2022-12-13 14:10:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:49,528 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 362 transitions. [2022-12-13 14:10:49,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 362 transitions. [2022-12-13 14:10:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 14:10:49,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:49,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:49,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 14:10:49,529 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -664511302, now seen corresponding path program 1 times [2022-12-13 14:10:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:49,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950807551] [2022-12-13 14:10:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:49,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950807551] [2022-12-13 14:10:49,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950807551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:49,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:49,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400028011] [2022-12-13 14:10:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:49,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:49,857 INFO L87 Difference]: Start difference. First operand 363 states and 362 transitions. Second operand has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:50,258 INFO L93 Difference]: Finished difference Result 362 states and 361 transitions. [2022-12-13 14:10:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-12-13 14:10:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:50,259 INFO L225 Difference]: With dead ends: 362 [2022-12-13 14:10:50,259 INFO L226 Difference]: Without dead ends: 362 [2022-12-13 14:10:50,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:50,260 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 639 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:50,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 486 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-12-13 14:10:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-12-13 14:10:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 299 states have (on average 1.2073578595317727) internal successors, (361), 361 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 361 transitions. [2022-12-13 14:10:50,262 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 361 transitions. Word has length 139 [2022-12-13 14:10:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:50,262 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 361 transitions. [2022-12-13 14:10:50,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 361 transitions. [2022-12-13 14:10:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-13 14:10:50,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:50,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:50,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 14:10:50,263 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash 307188531, now seen corresponding path program 1 times [2022-12-13 14:10:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:50,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620906866] [2022-12-13 14:10:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:50,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-12-13 14:10:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:50,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620906866] [2022-12-13 14:10:50,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620906866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:50,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:50,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591534998] [2022-12-13 14:10:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:50,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:50,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:50,409 INFO L87 Difference]: Start difference. First operand 362 states and 361 transitions. Second operand has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 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-12-13 14:10:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:50,530 INFO L93 Difference]: Finished difference Result 361 states and 360 transitions. [2022-12-13 14:10:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 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) Word has length 144 [2022-12-13 14:10:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:50,531 INFO L225 Difference]: With dead ends: 361 [2022-12-13 14:10:50,531 INFO L226 Difference]: Without dead ends: 361 [2022-12-13 14:10:50,531 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-12-13 14:10:50,531 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 435 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:50,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 361 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-12-13 14:10:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-12-13 14:10:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 299 states have (on average 1.2040133779264215) internal successors, (360), 360 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 360 transitions. [2022-12-13 14:10:50,535 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 360 transitions. Word has length 144 [2022-12-13 14:10:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:50,535 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 360 transitions. [2022-12-13 14:10:50,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 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-12-13 14:10:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 360 transitions. [2022-12-13 14:10:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-13 14:10:50,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:50,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:50,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 14:10:50,537 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 307188532, now seen corresponding path program 1 times [2022-12-13 14:10:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:50,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825258290] [2022-12-13 14:10:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:50,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:50,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825258290] [2022-12-13 14:10:50,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825258290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:50,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:50,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424574694] [2022-12-13 14:10:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:50,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:50,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:50,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:50,887 INFO L87 Difference]: Start difference. First operand 361 states and 360 transitions. Second operand has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 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-12-13 14:10:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:51,267 INFO L93 Difference]: Finished difference Result 360 states and 359 transitions. [2022-12-13 14:10:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 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) Word has length 144 [2022-12-13 14:10:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:51,268 INFO L225 Difference]: With dead ends: 360 [2022-12-13 14:10:51,268 INFO L226 Difference]: Without dead ends: 360 [2022-12-13 14:10:51,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:51,269 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 894 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:51,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 488 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-12-13 14:10:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-12-13 14:10:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 299 states have (on average 1.2006688963210703) internal successors, (359), 359 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 359 transitions. [2022-12-13 14:10:51,271 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 359 transitions. Word has length 144 [2022-12-13 14:10:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:51,271 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 359 transitions. [2022-12-13 14:10:51,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 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-12-13 14:10:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 359 transitions. [2022-12-13 14:10:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-13 14:10:51,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:51,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:51,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 14:10:51,272 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 334816458, now seen corresponding path program 1 times [2022-12-13 14:10:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:51,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256490653] [2022-12-13 14:10:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256490653] [2022-12-13 14:10:51,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256490653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:51,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:51,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:51,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430382237] [2022-12-13 14:10:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:51,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:51,411 INFO L87 Difference]: Start difference. First operand 360 states and 359 transitions. Second operand has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:51,596 INFO L93 Difference]: Finished difference Result 359 states and 358 transitions. [2022-12-13 14:10:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:51,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-12-13 14:10:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:51,599 INFO L225 Difference]: With dead ends: 359 [2022-12-13 14:10:51,599 INFO L226 Difference]: Without dead ends: 359 [2022-12-13 14:10:51,599 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-12-13 14:10:51,599 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 421 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:51,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 363 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-12-13 14:10:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2022-12-13 14:10:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 358 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 358 transitions. [2022-12-13 14:10:51,604 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 358 transitions. Word has length 149 [2022-12-13 14:10:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:51,604 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 358 transitions. [2022-12-13 14:10:51,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 358 transitions. [2022-12-13 14:10:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-13 14:10:51,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:51,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:51,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 14:10:51,605 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash 334816459, now seen corresponding path program 1 times [2022-12-13 14:10:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:51,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647873] [2022-12-13 14:10:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647873] [2022-12-13 14:10:51,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:51,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:51,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593497599] [2022-12-13 14:10:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:51,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:51,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:51,964 INFO L87 Difference]: Start difference. First operand 359 states and 358 transitions. Second operand has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:52,318 INFO L93 Difference]: Finished difference Result 358 states and 357 transitions. [2022-12-13 14:10:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:52,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-12-13 14:10:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:52,320 INFO L225 Difference]: With dead ends: 358 [2022-12-13 14:10:52,320 INFO L226 Difference]: Without dead ends: 358 [2022-12-13 14:10:52,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:52,321 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 828 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:52,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 449 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-12-13 14:10:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2022-12-13 14:10:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 299 states have (on average 1.193979933110368) internal successors, (357), 357 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 357 transitions. [2022-12-13 14:10:52,323 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 357 transitions. Word has length 149 [2022-12-13 14:10:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 357 transitions. [2022-12-13 14:10:52,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 357 transitions. [2022-12-13 14:10:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-13 14:10:52,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:52,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:52,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 14:10:52,325 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259036, now seen corresponding path program 1 times [2022-12-13 14:10:52,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:52,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643958742] [2022-12-13 14:10:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:52,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:52,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643958742] [2022-12-13 14:10:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643958742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:52,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:52,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594587190] [2022-12-13 14:10:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:52,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:52,462 INFO L87 Difference]: Start difference. First operand 358 states and 357 transitions. Second operand has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:52,601 INFO L93 Difference]: Finished difference Result 357 states and 356 transitions. [2022-12-13 14:10:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:52,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2022-12-13 14:10:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:52,603 INFO L225 Difference]: With dead ends: 357 [2022-12-13 14:10:52,603 INFO L226 Difference]: Without dead ends: 357 [2022-12-13 14:10:52,603 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-12-13 14:10:52,604 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 407 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:52,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 365 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-12-13 14:10:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-12-13 14:10:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.1906354515050168) internal successors, (356), 356 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 356 transitions. [2022-12-13 14:10:52,606 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 356 transitions. Word has length 154 [2022-12-13 14:10:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:52,607 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 356 transitions. [2022-12-13 14:10:52,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 356 transitions. [2022-12-13 14:10:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-13 14:10:52,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:52,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:52,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 14:10:52,607 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259035, now seen corresponding path program 1 times [2022-12-13 14:10:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:52,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866396309] [2022-12-13 14:10:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:52,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866396309] [2022-12-13 14:10:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866396309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028449650] [2022-12-13 14:10:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:52,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:52,965 INFO L87 Difference]: Start difference. First operand 357 states and 356 transitions. Second operand has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:53,320 INFO L93 Difference]: Finished difference Result 356 states and 355 transitions. [2022-12-13 14:10:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:53,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2022-12-13 14:10:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:53,322 INFO L225 Difference]: With dead ends: 356 [2022-12-13 14:10:53,322 INFO L226 Difference]: Without dead ends: 356 [2022-12-13 14:10:53,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:53,322 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 606 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:53,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 492 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-12-13 14:10:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-12-13 14:10:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 299 states have (on average 1.1872909698996656) internal successors, (355), 355 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 355 transitions. [2022-12-13 14:10:53,325 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 355 transitions. Word has length 154 [2022-12-13 14:10:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:53,325 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 355 transitions. [2022-12-13 14:10:53,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 355 transitions. [2022-12-13 14:10:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 14:10:53,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:53,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:53,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 14:10:53,325 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822629, now seen corresponding path program 1 times [2022-12-13 14:10:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:53,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495160346] [2022-12-13 14:10:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:53,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:53,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495160346] [2022-12-13 14:10:53,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495160346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:53,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:53,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484143053] [2022-12-13 14:10:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:53,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:53,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:53,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:53,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:53,475 INFO L87 Difference]: Start difference. First operand 356 states and 355 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 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-12-13 14:10:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:53,637 INFO L93 Difference]: Finished difference Result 355 states and 354 transitions. [2022-12-13 14:10:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:53,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 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) Word has length 159 [2022-12-13 14:10:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:53,638 INFO L225 Difference]: With dead ends: 355 [2022-12-13 14:10:53,638 INFO L226 Difference]: Without dead ends: 355 [2022-12-13 14:10:53,638 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-12-13 14:10:53,639 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 393 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:53,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 367 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-12-13 14:10:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-12-13 14:10:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 299 states have (on average 1.1839464882943145) internal successors, (354), 354 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:53,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 354 transitions. [2022-12-13 14:10:53,641 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 354 transitions. Word has length 159 [2022-12-13 14:10:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:53,641 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 354 transitions. [2022-12-13 14:10:53,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 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-12-13 14:10:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 354 transitions. [2022-12-13 14:10:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 14:10:53,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:53,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:53,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 14:10:53,642 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822628, now seen corresponding path program 1 times [2022-12-13 14:10:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:53,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931443690] [2022-12-13 14:10:53,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:53,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931443690] [2022-12-13 14:10:53,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931443690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:53,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:53,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:10:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958270844] [2022-12-13 14:10:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:53,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:10:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:10:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:10:54,000 INFO L87 Difference]: Start difference. First operand 355 states and 354 transitions. Second operand has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 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-12-13 14:10:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:54,392 INFO L93 Difference]: Finished difference Result 354 states and 353 transitions. [2022-12-13 14:10:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:54,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 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) Word has length 159 [2022-12-13 14:10:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:54,393 INFO L225 Difference]: With dead ends: 354 [2022-12-13 14:10:54,393 INFO L226 Difference]: Without dead ends: 354 [2022-12-13 14:10:54,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:10:54,393 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 792 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:54,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-12-13 14:10:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-12-13 14:10:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 299 states have (on average 1.1806020066889633) internal successors, (353), 353 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 353 transitions. [2022-12-13 14:10:54,396 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 353 transitions. Word has length 159 [2022-12-13 14:10:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:54,396 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 353 transitions. [2022-12-13 14:10:54,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 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-12-13 14:10:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 353 transitions. [2022-12-13 14:10:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 14:10:54,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:54,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:54,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 14:10:54,397 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash 117597077, now seen corresponding path program 1 times [2022-12-13 14:10:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000235401] [2022-12-13 14:10:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000235401] [2022-12-13 14:10:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000235401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:54,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:54,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34783952] [2022-12-13 14:10:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:54,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:54,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:54,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:54,587 INFO L87 Difference]: Start difference. First operand 354 states and 353 transitions. Second operand has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 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-12-13 14:10:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:54,749 INFO L93 Difference]: Finished difference Result 353 states and 352 transitions. [2022-12-13 14:10:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 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) Word has length 164 [2022-12-13 14:10:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:54,750 INFO L225 Difference]: With dead ends: 353 [2022-12-13 14:10:54,750 INFO L226 Difference]: Without dead ends: 353 [2022-12-13 14:10:54,750 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-12-13 14:10:54,750 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 379 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:54,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 369 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-12-13 14:10:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-12-13 14:10:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 299 states have (on average 1.1772575250836121) internal successors, (352), 352 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 352 transitions. [2022-12-13 14:10:54,753 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 352 transitions. Word has length 164 [2022-12-13 14:10:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:54,754 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 352 transitions. [2022-12-13 14:10:54,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 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-12-13 14:10:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 352 transitions. [2022-12-13 14:10:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 14:10:54,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:54,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:54,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 14:10:54,754 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash 117597078, now seen corresponding path program 1 times [2022-12-13 14:10:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:54,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131065721] [2022-12-13 14:10:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:55,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131065721] [2022-12-13 14:10:55,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131065721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:55,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:55,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301851526] [2022-12-13 14:10:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:55,120 INFO L87 Difference]: Start difference. First operand 353 states and 352 transitions. Second operand has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 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-12-13 14:10:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:55,426 INFO L93 Difference]: Finished difference Result 352 states and 351 transitions. [2022-12-13 14:10:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:55,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 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) Word has length 164 [2022-12-13 14:10:55,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:55,427 INFO L225 Difference]: With dead ends: 352 [2022-12-13 14:10:55,427 INFO L226 Difference]: Without dead ends: 352 [2022-12-13 14:10:55,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:55,428 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 774 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:55,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 455 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-12-13 14:10:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-12-13 14:10:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 299 states have (on average 1.173913043478261) internal successors, (351), 351 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 351 transitions. [2022-12-13 14:10:55,430 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 351 transitions. Word has length 164 [2022-12-13 14:10:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:55,430 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 351 transitions. [2022-12-13 14:10:55,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 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-12-13 14:10:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 351 transitions. [2022-12-13 14:10:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-13 14:10:55,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:55,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:55,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 14:10:55,431 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:55,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash 264564972, now seen corresponding path program 1 times [2022-12-13 14:10:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:55,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857558401] [2022-12-13 14:10:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:55,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857558401] [2022-12-13 14:10:55,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857558401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:55,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:55,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655499879] [2022-12-13 14:10:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:55,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:55,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:55,584 INFO L87 Difference]: Start difference. First operand 352 states and 351 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:55,713 INFO L93 Difference]: Finished difference Result 351 states and 350 transitions. [2022-12-13 14:10:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:55,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-12-13 14:10:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:55,716 INFO L225 Difference]: With dead ends: 351 [2022-12-13 14:10:55,716 INFO L226 Difference]: Without dead ends: 351 [2022-12-13 14:10:55,716 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-12-13 14:10:55,716 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 365 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:55,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-12-13 14:10:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-12-13 14:10:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 299 states have (on average 1.1705685618729098) internal successors, (350), 350 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 350 transitions. [2022-12-13 14:10:55,718 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 350 transitions. Word has length 169 [2022-12-13 14:10:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:55,719 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 350 transitions. [2022-12-13 14:10:55,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 350 transitions. [2022-12-13 14:10:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-13 14:10:55,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:55,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:55,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 14:10:55,719 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash 264564973, now seen corresponding path program 1 times [2022-12-13 14:10:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:55,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740588174] [2022-12-13 14:10:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:56,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740588174] [2022-12-13 14:10:56,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740588174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:56,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:56,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663993574] [2022-12-13 14:10:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:56,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:56,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:56,106 INFO L87 Difference]: Start difference. First operand 351 states and 350 transitions. Second operand has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:56,492 INFO L93 Difference]: Finished difference Result 350 states and 349 transitions. [2022-12-13 14:10:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:56,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-12-13 14:10:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:56,493 INFO L225 Difference]: With dead ends: 350 [2022-12-13 14:10:56,493 INFO L226 Difference]: Without dead ends: 350 [2022-12-13 14:10:56,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:56,493 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 573 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:56,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 498 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-12-13 14:10:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2022-12-13 14:10:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 349 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 349 transitions. [2022-12-13 14:10:56,496 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 349 transitions. Word has length 169 [2022-12-13 14:10:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:56,496 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 349 transitions. [2022-12-13 14:10:56,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 349 transitions. [2022-12-13 14:10:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-13 14:10:56,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:56,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 14:10:56,497 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368902, now seen corresponding path program 1 times [2022-12-13 14:10:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:56,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828481587] [2022-12-13 14:10:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:56,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828481587] [2022-12-13 14:10:56,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828481587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:56,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:56,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825305441] [2022-12-13 14:10:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:56,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:56,680 INFO L87 Difference]: Start difference. First operand 350 states and 349 transitions. Second operand has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:56,846 INFO L93 Difference]: Finished difference Result 349 states and 348 transitions. [2022-12-13 14:10:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-12-13 14:10:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:56,848 INFO L225 Difference]: With dead ends: 349 [2022-12-13 14:10:56,848 INFO L226 Difference]: Without dead ends: 349 [2022-12-13 14:10:56,848 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-12-13 14:10:56,849 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 351 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:56,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 373 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:10:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-12-13 14:10:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-12-13 14:10:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 299 states have (on average 1.1638795986622072) internal successors, (348), 348 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 348 transitions. [2022-12-13 14:10:56,854 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 348 transitions. Word has length 174 [2022-12-13 14:10:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:56,854 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 348 transitions. [2022-12-13 14:10:56,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 348 transitions. [2022-12-13 14:10:56,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-12-13 14:10:56,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:56,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:56,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 14:10:56,856 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368903, now seen corresponding path program 1 times [2022-12-13 14:10:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:56,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497890350] [2022-12-13 14:10:56,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:56,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:57,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497890350] [2022-12-13 14:10:57,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497890350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:57,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:57,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177850164] [2022-12-13 14:10:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:57,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:57,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:57,258 INFO L87 Difference]: Start difference. First operand 349 states and 348 transitions. Second operand has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:57,587 INFO L93 Difference]: Finished difference Result 348 states and 347 transitions. [2022-12-13 14:10:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-12-13 14:10:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:57,588 INFO L225 Difference]: With dead ends: 348 [2022-12-13 14:10:57,588 INFO L226 Difference]: Without dead ends: 348 [2022-12-13 14:10:57,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:57,588 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 738 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:57,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 459 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-12-13 14:10:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2022-12-13 14:10:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 299 states have (on average 1.160535117056856) internal successors, (347), 347 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 347 transitions. [2022-12-13 14:10:57,591 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 347 transitions. Word has length 174 [2022-12-13 14:10:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:57,591 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 347 transitions. [2022-12-13 14:10:57,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 347 transitions. [2022-12-13 14:10:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-13 14:10:57,592 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:57,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:57,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 14:10:57,592 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 135427325, now seen corresponding path program 1 times [2022-12-13 14:10:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:57,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132875942] [2022-12-13 14:10:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:57,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132875942] [2022-12-13 14:10:57,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132875942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:57,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:57,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318034363] [2022-12-13 14:10:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:57,804 INFO L87 Difference]: Start difference. First operand 348 states and 347 transitions. Second operand has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:57,948 INFO L93 Difference]: Finished difference Result 347 states and 346 transitions. [2022-12-13 14:10:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:57,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-12-13 14:10:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:57,949 INFO L225 Difference]: With dead ends: 347 [2022-12-13 14:10:57,949 INFO L226 Difference]: Without dead ends: 347 [2022-12-13 14:10:57,949 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-12-13 14:10:57,950 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 337 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:57,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 375 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-12-13 14:10:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-12-13 14:10:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 299 states have (on average 1.157190635451505) internal successors, (346), 346 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 346 transitions. [2022-12-13 14:10:57,952 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 346 transitions. Word has length 179 [2022-12-13 14:10:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:57,952 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 346 transitions. [2022-12-13 14:10:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 346 transitions. [2022-12-13 14:10:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-13 14:10:57,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:57,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 14:10:57,953 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 135427326, now seen corresponding path program 1 times [2022-12-13 14:10:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:57,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086903063] [2022-12-13 14:10:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086903063] [2022-12-13 14:10:58,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086903063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:58,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:58,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563764460] [2022-12-13 14:10:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:58,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:58,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:58,404 INFO L87 Difference]: Start difference. First operand 347 states and 346 transitions. Second operand has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:58,772 INFO L93 Difference]: Finished difference Result 346 states and 345 transitions. [2022-12-13 14:10:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-12-13 14:10:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:58,773 INFO L225 Difference]: With dead ends: 346 [2022-12-13 14:10:58,773 INFO L226 Difference]: Without dead ends: 346 [2022-12-13 14:10:58,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:58,773 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 551 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:58,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 502 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-12-13 14:10:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-12-13 14:10:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 299 states have (on average 1.1538461538461537) internal successors, (345), 345 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 345 transitions. [2022-12-13 14:10:58,776 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 345 transitions. Word has length 179 [2022-12-13 14:10:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:58,776 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 345 transitions. [2022-12-13 14:10:58,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 345 transitions. [2022-12-13 14:10:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 14:10:58,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:58,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:58,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 14:10:58,777 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:58,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -277470217, now seen corresponding path program 1 times [2022-12-13 14:10:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:58,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606310355] [2022-12-13 14:10:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:58,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:58,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606310355] [2022-12-13 14:10:58,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606310355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:58,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:58,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:10:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57998850] [2022-12-13 14:10:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:58,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:10:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:10:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:10:58,954 INFO L87 Difference]: Start difference. First operand 346 states and 345 transitions. Second operand has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:59,101 INFO L93 Difference]: Finished difference Result 345 states and 344 transitions. [2022-12-13 14:10:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:10:59,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2022-12-13 14:10:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:59,103 INFO L225 Difference]: With dead ends: 345 [2022-12-13 14:10:59,103 INFO L226 Difference]: Without dead ends: 345 [2022-12-13 14:10:59,103 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-12-13 14:10:59,103 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 323 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:59,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 377 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:10:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-12-13 14:10:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2022-12-13 14:10:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 299 states have (on average 1.1505016722408026) internal successors, (344), 344 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 344 transitions. [2022-12-13 14:10:59,105 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 344 transitions. Word has length 184 [2022-12-13 14:10:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:59,106 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 344 transitions. [2022-12-13 14:10:59,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 344 transitions. [2022-12-13 14:10:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 14:10:59,106 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:59,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:59,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 14:10:59,107 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:59,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash -277470216, now seen corresponding path program 1 times [2022-12-13 14:10:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:59,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785217858] [2022-12-13 14:10:59,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:10:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:10:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:10:59,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:10:59,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785217858] [2022-12-13 14:10:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785217858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:10:59,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:10:59,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:10:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680172755] [2022-12-13 14:10:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:10:59,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:10:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:10:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:10:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:10:59,539 INFO L87 Difference]: Start difference. First operand 345 states and 344 transitions. Second operand has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:10:59,935 INFO L93 Difference]: Finished difference Result 344 states and 343 transitions. [2022-12-13 14:10:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:10:59,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2022-12-13 14:10:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:10:59,938 INFO L225 Difference]: With dead ends: 344 [2022-12-13 14:10:59,938 INFO L226 Difference]: Without dead ends: 344 [2022-12-13 14:10:59,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:10:59,938 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 540 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:10:59,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 504 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:10:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-12-13 14:10:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-12-13 14:10:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 299 states have (on average 1.1471571906354514) internal successors, (343), 343 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 343 transitions. [2022-12-13 14:10:59,944 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 343 transitions. Word has length 184 [2022-12-13 14:10:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:10:59,944 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 343 transitions. [2022-12-13 14:10:59,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:10:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 343 transitions. [2022-12-13 14:10:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 14:10:59,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:10:59,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:10:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 14:10:59,946 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:10:59,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:10:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash -993899250, now seen corresponding path program 1 times [2022-12-13 14:10:59,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:10:59,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606227791] [2022-12-13 14:10:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:10:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:00,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:00,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606227791] [2022-12-13 14:11:00,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606227791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:00,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:00,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267094048] [2022-12-13 14:11:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:00,229 INFO L87 Difference]: Start difference. First operand 344 states and 343 transitions. Second operand has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:00,383 INFO L93 Difference]: Finished difference Result 343 states and 342 transitions. [2022-12-13 14:11:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-12-13 14:11:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:00,386 INFO L225 Difference]: With dead ends: 343 [2022-12-13 14:11:00,386 INFO L226 Difference]: Without dead ends: 343 [2022-12-13 14:11:00,386 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-12-13 14:11:00,386 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 309 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:00,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 379 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-12-13 14:11:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-12-13 14:11:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 299 states have (on average 1.1438127090301002) internal successors, (342), 342 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 342 transitions. [2022-12-13 14:11:00,391 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 342 transitions. Word has length 189 [2022-12-13 14:11:00,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:00,391 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 342 transitions. [2022-12-13 14:11:00,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 342 transitions. [2022-12-13 14:11:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 14:11:00,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:00,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:00,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 14:11:00,392 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:00,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -993899249, now seen corresponding path program 1 times [2022-12-13 14:11:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:00,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102115251] [2022-12-13 14:11:00,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102115251] [2022-12-13 14:11:00,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102115251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:00,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:00,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615288877] [2022-12-13 14:11:00,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:00,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:00,881 INFO L87 Difference]: Start difference. First operand 343 states and 342 transitions. Second operand has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:01,344 INFO L93 Difference]: Finished difference Result 342 states and 341 transitions. [2022-12-13 14:11:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-12-13 14:11:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:01,346 INFO L225 Difference]: With dead ends: 342 [2022-12-13 14:11:01,346 INFO L226 Difference]: Without dead ends: 342 [2022-12-13 14:11:01,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:01,347 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 529 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:01,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 547 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-12-13 14:11:01,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-12-13 14:11:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.140468227424749) internal successors, (341), 341 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 341 transitions. [2022-12-13 14:11:01,350 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 341 transitions. Word has length 189 [2022-12-13 14:11:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:01,350 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 341 transitions. [2022-12-13 14:11:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 341 transitions. [2022-12-13 14:11:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-13 14:11:01,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:01,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:01,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 14:11:01,351 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751720, now seen corresponding path program 1 times [2022-12-13 14:11:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:01,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873592540] [2022-12-13 14:11:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:01,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873592540] [2022-12-13 14:11:01,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873592540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:01,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:01,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021607530] [2022-12-13 14:11:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:01,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:01,532 INFO L87 Difference]: Start difference. First operand 342 states and 341 transitions. Second operand has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:01,718 INFO L93 Difference]: Finished difference Result 341 states and 340 transitions. [2022-12-13 14:11:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:01,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2022-12-13 14:11:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:01,720 INFO L225 Difference]: With dead ends: 341 [2022-12-13 14:11:01,720 INFO L226 Difference]: Without dead ends: 341 [2022-12-13 14:11:01,720 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-12-13 14:11:01,720 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 295 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:01,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 381 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-12-13 14:11:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-12-13 14:11:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 299 states have (on average 1.137123745819398) internal successors, (340), 340 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 340 transitions. [2022-12-13 14:11:01,723 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 340 transitions. Word has length 194 [2022-12-13 14:11:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:01,723 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 340 transitions. [2022-12-13 14:11:01,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 340 transitions. [2022-12-13 14:11:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-13 14:11:01,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:01,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:01,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 14:11:01,724 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751721, now seen corresponding path program 1 times [2022-12-13 14:11:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605815461] [2022-12-13 14:11:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:02,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605815461] [2022-12-13 14:11:02,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605815461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:02,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:02,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790207323] [2022-12-13 14:11:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:02,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:02,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:02,178 INFO L87 Difference]: Start difference. First operand 341 states and 340 transitions. Second operand has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:02,642 INFO L93 Difference]: Finished difference Result 340 states and 339 transitions. [2022-12-13 14:11:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2022-12-13 14:11:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:02,643 INFO L225 Difference]: With dead ends: 340 [2022-12-13 14:11:02,643 INFO L226 Difference]: Without dead ends: 340 [2022-12-13 14:11:02,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:02,643 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 764 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:02,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 508 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-12-13 14:11:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-12-13 14:11:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 299 states have (on average 1.1337792642140467) internal successors, (339), 339 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 339 transitions. [2022-12-13 14:11:02,646 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 339 transitions. Word has length 194 [2022-12-13 14:11:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 339 transitions. [2022-12-13 14:11:02,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 339 transitions. [2022-12-13 14:11:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-13 14:11:02,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:02,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:02,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 14:11:02,647 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592929, now seen corresponding path program 1 times [2022-12-13 14:11:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:02,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495092908] [2022-12-13 14:11:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:02,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-12-13 14:11:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495092908] [2022-12-13 14:11:02,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495092908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:02,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:02,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354257941] [2022-12-13 14:11:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:02,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:02,826 INFO L87 Difference]: Start difference. First operand 340 states and 339 transitions. Second operand has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:02,970 INFO L93 Difference]: Finished difference Result 339 states and 338 transitions. [2022-12-13 14:11:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2022-12-13 14:11:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:02,971 INFO L225 Difference]: With dead ends: 339 [2022-12-13 14:11:02,971 INFO L226 Difference]: Without dead ends: 339 [2022-12-13 14:11:02,971 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-12-13 14:11:02,971 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 281 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:02,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 383 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-12-13 14:11:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-12-13 14:11:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 299 states have (on average 1.1304347826086956) internal successors, (338), 338 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 338 transitions. [2022-12-13 14:11:02,974 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 338 transitions. Word has length 199 [2022-12-13 14:11:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:02,974 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 338 transitions. [2022-12-13 14:11:02,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 338 transitions. [2022-12-13 14:11:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-13 14:11:02,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:02,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:02,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 14:11:02,975 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592928, now seen corresponding path program 1 times [2022-12-13 14:11:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:02,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396377586] [2022-12-13 14:11:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:03,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396377586] [2022-12-13 14:11:03,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396377586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:03,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:03,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15413374] [2022-12-13 14:11:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:03,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:03,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:03,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:03,424 INFO L87 Difference]: Start difference. First operand 339 states and 338 transitions. Second operand has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:03,825 INFO L93 Difference]: Finished difference Result 338 states and 337 transitions. [2022-12-13 14:11:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2022-12-13 14:11:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:03,828 INFO L225 Difference]: With dead ends: 338 [2022-12-13 14:11:03,828 INFO L226 Difference]: Without dead ends: 338 [2022-12-13 14:11:03,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:03,828 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 751 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:03,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 510 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-12-13 14:11:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-12-13 14:11:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 299 states have (on average 1.1270903010033444) internal successors, (337), 337 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 337 transitions. [2022-12-13 14:11:03,831 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 337 transitions. Word has length 199 [2022-12-13 14:11:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:03,831 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 337 transitions. [2022-12-13 14:11:03,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 337 transitions. [2022-12-13 14:11:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-13 14:11:03,831 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:03,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:03,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 14:11:03,832 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430246, now seen corresponding path program 1 times [2022-12-13 14:11:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:03,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484803263] [2022-12-13 14:11:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:04,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:04,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484803263] [2022-12-13 14:11:04,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484803263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:04,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:04,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:04,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064979416] [2022-12-13 14:11:04,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:04,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:04,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:04,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:04,304 INFO L87 Difference]: Start difference. First operand 338 states and 337 transitions. Second operand has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:04,668 INFO L93 Difference]: Finished difference Result 337 states and 336 transitions. [2022-12-13 14:11:04,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2022-12-13 14:11:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:04,669 INFO L225 Difference]: With dead ends: 337 [2022-12-13 14:11:04,669 INFO L226 Difference]: Without dead ends: 337 [2022-12-13 14:11:04,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:04,670 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 742 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:04,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 512 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-12-13 14:11:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2022-12-13 14:11:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 299 states have (on average 1.1237458193979932) internal successors, (336), 336 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 336 transitions. [2022-12-13 14:11:04,672 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 336 transitions. Word has length 204 [2022-12-13 14:11:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:04,672 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 336 transitions. [2022-12-13 14:11:04,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 336 transitions. [2022-12-13 14:11:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-12-13 14:11:04,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:04,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:04,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 14:11:04,674 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430247, now seen corresponding path program 1 times [2022-12-13 14:11:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:04,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58258455] [2022-12-13 14:11:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:04,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58258455] [2022-12-13 14:11:04,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58258455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:04,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:04,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:04,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984510748] [2022-12-13 14:11:04,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:04,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:04,858 INFO L87 Difference]: Start difference. First operand 337 states and 336 transitions. Second operand has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:04,990 INFO L93 Difference]: Finished difference Result 336 states and 335 transitions. [2022-12-13 14:11:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2022-12-13 14:11:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:04,991 INFO L225 Difference]: With dead ends: 336 [2022-12-13 14:11:04,991 INFO L226 Difference]: Without dead ends: 336 [2022-12-13 14:11:04,991 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-12-13 14:11:04,991 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 265 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:04,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-12-13 14:11:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2022-12-13 14:11:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 299 states have (on average 1.120401337792642) internal successors, (335), 335 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 335 transitions. [2022-12-13 14:11:04,994 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 335 transitions. Word has length 204 [2022-12-13 14:11:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:04,994 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 335 transitions. [2022-12-13 14:11:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 335 transitions. [2022-12-13 14:11:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-13 14:11:04,994 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:04,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:04,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 14:11:04,995 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749136, now seen corresponding path program 1 times [2022-12-13 14:11:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:04,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345179680] [2022-12-13 14:11:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:05,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345179680] [2022-12-13 14:11:05,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345179680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:05,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:05,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692705587] [2022-12-13 14:11:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:05,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:05,186 INFO L87 Difference]: Start difference. First operand 336 states and 335 transitions. Second operand has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:05,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:05,317 INFO L93 Difference]: Finished difference Result 335 states and 334 transitions. [2022-12-13 14:11:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2022-12-13 14:11:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:05,320 INFO L225 Difference]: With dead ends: 335 [2022-12-13 14:11:05,320 INFO L226 Difference]: Without dead ends: 335 [2022-12-13 14:11:05,320 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-12-13 14:11:05,320 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 253 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:05,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 387 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-12-13 14:11:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2022-12-13 14:11:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 299 states have (on average 1.117056856187291) internal successors, (334), 334 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 334 transitions. [2022-12-13 14:11:05,322 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 334 transitions. Word has length 209 [2022-12-13 14:11:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:05,323 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 334 transitions. [2022-12-13 14:11:05,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 334 transitions. [2022-12-13 14:11:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-13 14:11:05,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:05,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:05,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 14:11:05,324 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749135, now seen corresponding path program 1 times [2022-12-13 14:11:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:05,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753327782] [2022-12-13 14:11:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:05,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:05,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753327782] [2022-12-13 14:11:05,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753327782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:05,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:05,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396122941] [2022-12-13 14:11:05,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:05,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:05,835 INFO L87 Difference]: Start difference. First operand 335 states and 334 transitions. Second operand has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:06,185 INFO L93 Difference]: Finished difference Result 334 states and 333 transitions. [2022-12-13 14:11:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2022-12-13 14:11:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:06,187 INFO L225 Difference]: With dead ends: 334 [2022-12-13 14:11:06,187 INFO L226 Difference]: Without dead ends: 334 [2022-12-13 14:11:06,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:06,188 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 612 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:06,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 473 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-12-13 14:11:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-12-13 14:11:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 1.1137123745819397) internal successors, (333), 333 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 333 transitions. [2022-12-13 14:11:06,190 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 333 transitions. Word has length 209 [2022-12-13 14:11:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:06,190 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 333 transitions. [2022-12-13 14:11:06,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 333 transitions. [2022-12-13 14:11:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-13 14:11:06,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:06,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:06,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 14:11:06,191 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:06,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476918, now seen corresponding path program 1 times [2022-12-13 14:11:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:06,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356462354] [2022-12-13 14:11:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:06,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:06,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356462354] [2022-12-13 14:11:06,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356462354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:06,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:06,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701270410] [2022-12-13 14:11:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:06,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:06,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:06,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:06,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:06,385 INFO L87 Difference]: Start difference. First operand 334 states and 333 transitions. Second operand has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:06,574 INFO L93 Difference]: Finished difference Result 333 states and 332 transitions. [2022-12-13 14:11:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2022-12-13 14:11:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:06,576 INFO L225 Difference]: With dead ends: 333 [2022-12-13 14:11:06,576 INFO L226 Difference]: Without dead ends: 333 [2022-12-13 14:11:06,576 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-12-13 14:11:06,576 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 239 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:06,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 389 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-12-13 14:11:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-12-13 14:11:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.1103678929765886) internal successors, (332), 332 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 332 transitions. [2022-12-13 14:11:06,580 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 332 transitions. Word has length 214 [2022-12-13 14:11:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:06,580 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 332 transitions. [2022-12-13 14:11:06,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 332 transitions. [2022-12-13 14:11:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-12-13 14:11:06,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:06,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:06,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 14:11:06,581 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476917, now seen corresponding path program 1 times [2022-12-13 14:11:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373778090] [2022-12-13 14:11:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:07,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373778090] [2022-12-13 14:11:07,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373778090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:07,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:07,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:07,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937132707] [2022-12-13 14:11:07,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:07,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:07,067 INFO L87 Difference]: Start difference. First operand 333 states and 332 transitions. Second operand has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:07,515 INFO L93 Difference]: Finished difference Result 332 states and 331 transitions. [2022-12-13 14:11:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2022-12-13 14:11:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:07,516 INFO L225 Difference]: With dead ends: 332 [2022-12-13 14:11:07,516 INFO L226 Difference]: Without dead ends: 332 [2022-12-13 14:11:07,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:07,516 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 594 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:07,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 475 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-12-13 14:11:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-12-13 14:11:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 299 states have (on average 1.1070234113712374) internal successors, (331), 331 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 331 transitions. [2022-12-13 14:11:07,518 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 331 transitions. Word has length 214 [2022-12-13 14:11:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:07,519 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 331 transitions. [2022-12-13 14:11:07,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 331 transitions. [2022-12-13 14:11:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-13 14:11:07,519 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:07,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:07,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 14:11:07,520 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118593, now seen corresponding path program 1 times [2022-12-13 14:11:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849290761] [2022-12-13 14:11:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:07,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849290761] [2022-12-13 14:11:07,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849290761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:07,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:07,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936715059] [2022-12-13 14:11:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:07,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:07,720 INFO L87 Difference]: Start difference. First operand 332 states and 331 transitions. Second operand has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:07,874 INFO L93 Difference]: Finished difference Result 331 states and 330 transitions. [2022-12-13 14:11:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:07,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2022-12-13 14:11:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:07,875 INFO L225 Difference]: With dead ends: 331 [2022-12-13 14:11:07,875 INFO L226 Difference]: Without dead ends: 331 [2022-12-13 14:11:07,875 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-12-13 14:11:07,875 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:07,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 391 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-12-13 14:11:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-12-13 14:11:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.1036789297658862) internal successors, (330), 330 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 330 transitions. [2022-12-13 14:11:07,878 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 330 transitions. Word has length 219 [2022-12-13 14:11:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:07,878 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 330 transitions. [2022-12-13 14:11:07,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 330 transitions. [2022-12-13 14:11:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-13 14:11:07,879 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:07,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:07,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 14:11:07,879 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118594, now seen corresponding path program 1 times [2022-12-13 14:11:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:07,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827735355] [2022-12-13 14:11:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:08,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827735355] [2022-12-13 14:11:08,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827735355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:08,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:08,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819673042] [2022-12-13 14:11:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:08,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:08,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:08,448 INFO L87 Difference]: Start difference. First operand 331 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:08,900 INFO L93 Difference]: Finished difference Result 330 states and 329 transitions. [2022-12-13 14:11:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2022-12-13 14:11:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:08,901 INFO L225 Difference]: With dead ends: 330 [2022-12-13 14:11:08,901 INFO L226 Difference]: Without dead ends: 330 [2022-12-13 14:11:08,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:08,902 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 812 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:08,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 477 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-12-13 14:11:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2022-12-13 14:11:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 299 states have (on average 1.100334448160535) internal successors, (329), 329 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 329 transitions. [2022-12-13 14:11:08,904 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 329 transitions. Word has length 219 [2022-12-13 14:11:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:08,904 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 329 transitions. [2022-12-13 14:11:08,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 329 transitions. [2022-12-13 14:11:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-13 14:11:08,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:08,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:08,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 14:11:08,905 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147845, now seen corresponding path program 1 times [2022-12-13 14:11:08,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:08,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568583875] [2022-12-13 14:11:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:09,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568583875] [2022-12-13 14:11:09,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568583875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:09,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:09,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:09,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402112743] [2022-12-13 14:11:09,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:09,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:09,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:09,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:09,113 INFO L87 Difference]: Start difference. First operand 330 states and 329 transitions. Second operand has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:09,299 INFO L93 Difference]: Finished difference Result 329 states and 328 transitions. [2022-12-13 14:11:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:09,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2022-12-13 14:11:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:09,301 INFO L225 Difference]: With dead ends: 329 [2022-12-13 14:11:09,301 INFO L226 Difference]: Without dead ends: 329 [2022-12-13 14:11:09,301 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-12-13 14:11:09,302 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 211 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:09,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 393 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-12-13 14:11:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-12-13 14:11:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 299 states have (on average 1.0969899665551839) internal successors, (328), 328 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 328 transitions. [2022-12-13 14:11:09,305 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 328 transitions. Word has length 224 [2022-12-13 14:11:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:09,305 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 328 transitions. [2022-12-13 14:11:09,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 328 transitions. [2022-12-13 14:11:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-13 14:11:09,306 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:09,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:09,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 14:11:09,306 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147844, now seen corresponding path program 1 times [2022-12-13 14:11:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:09,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444226868] [2022-12-13 14:11:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:09,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444226868] [2022-12-13 14:11:09,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444226868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:09,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:09,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502678566] [2022-12-13 14:11:09,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:09,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:09,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:09,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:09,807 INFO L87 Difference]: Start difference. First operand 329 states and 328 transitions. Second operand has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:10,157 INFO L93 Difference]: Finished difference Result 328 states and 327 transitions. [2022-12-13 14:11:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:10,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2022-12-13 14:11:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:10,159 INFO L225 Difference]: With dead ends: 328 [2022-12-13 14:11:10,159 INFO L226 Difference]: Without dead ends: 328 [2022-12-13 14:11:10,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:10,160 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 558 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:10,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 479 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-12-13 14:11:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-12-13 14:11:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 299 states have (on average 1.0936454849498327) internal successors, (327), 327 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 327 transitions. [2022-12-13 14:11:10,162 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 327 transitions. Word has length 224 [2022-12-13 14:11:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:10,162 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 327 transitions. [2022-12-13 14:11:10,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 327 transitions. [2022-12-13 14:11:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-12-13 14:11:10,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:10,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:10,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 14:11:10,163 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:10,163 INFO L85 PathProgramCache]: Analyzing trace with hash -551226030, now seen corresponding path program 1 times [2022-12-13 14:11:10,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:10,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403081867] [2022-12-13 14:11:10,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:10,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403081867] [2022-12-13 14:11:10,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403081867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:10,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:10,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321310522] [2022-12-13 14:11:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:10,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:10,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:10,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:10,369 INFO L87 Difference]: Start difference. First operand 328 states and 327 transitions. Second operand has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:10,559 INFO L93 Difference]: Finished difference Result 327 states and 326 transitions. [2022-12-13 14:11:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-12-13 14:11:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:10,562 INFO L225 Difference]: With dead ends: 327 [2022-12-13 14:11:10,562 INFO L226 Difference]: Without dead ends: 327 [2022-12-13 14:11:10,562 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-12-13 14:11:10,562 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 197 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:10,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 395 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-12-13 14:11:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-12-13 14:11:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 299 states have (on average 1.0903010033444815) internal successors, (326), 326 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 326 transitions. [2022-12-13 14:11:10,566 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 326 transitions. Word has length 229 [2022-12-13 14:11:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:10,567 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 326 transitions. [2022-12-13 14:11:10,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 326 transitions. [2022-12-13 14:11:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-12-13 14:11:10,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:10,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:10,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 14:11:10,568 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -551226029, now seen corresponding path program 1 times [2022-12-13 14:11:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:10,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851731955] [2022-12-13 14:11:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851731955] [2022-12-13 14:11:11,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851731955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:11,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:11,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968853044] [2022-12-13 14:11:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:11,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:11,088 INFO L87 Difference]: Start difference. First operand 327 states and 326 transitions. Second operand has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:11,539 INFO L93 Difference]: Finished difference Result 326 states and 325 transitions. [2022-12-13 14:11:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-12-13 14:11:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:11,540 INFO L225 Difference]: With dead ends: 326 [2022-12-13 14:11:11,540 INFO L226 Difference]: Without dead ends: 326 [2022-12-13 14:11:11,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:11,541 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 441 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:11,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 522 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-12-13 14:11:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-12-13 14:11:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 299 states have (on average 1.0869565217391304) internal successors, (325), 325 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 325 transitions. [2022-12-13 14:11:11,543 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 325 transitions. Word has length 229 [2022-12-13 14:11:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:11,543 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 325 transitions. [2022-12-13 14:11:11,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 325 transitions. [2022-12-13 14:11:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-13 14:11:11,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:11,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:11,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 14:11:11,544 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196692, now seen corresponding path program 1 times [2022-12-13 14:11:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:11,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407969641] [2022-12-13 14:11:11,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407969641] [2022-12-13 14:11:11,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407969641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:11,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:11,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921923905] [2022-12-13 14:11:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:11,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:11,753 INFO L87 Difference]: Start difference. First operand 326 states and 325 transitions. Second operand has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:11,944 INFO L93 Difference]: Finished difference Result 325 states and 324 transitions. [2022-12-13 14:11:11,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:11,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-12-13 14:11:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:11,946 INFO L225 Difference]: With dead ends: 325 [2022-12-13 14:11:11,946 INFO L226 Difference]: Without dead ends: 325 [2022-12-13 14:11:11,946 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-12-13 14:11:11,946 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 183 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:11,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 397 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-12-13 14:11:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-12-13 14:11:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 299 states have (on average 1.0836120401337792) internal successors, (324), 324 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 324 transitions. [2022-12-13 14:11:11,951 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 324 transitions. Word has length 234 [2022-12-13 14:11:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:11,951 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 324 transitions. [2022-12-13 14:11:11,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:11,951 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 324 transitions. [2022-12-13 14:11:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-12-13 14:11:11,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:11,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:11,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 14:11:11,952 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196691, now seen corresponding path program 1 times [2022-12-13 14:11:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:11,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406697687] [2022-12-13 14:11:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:12,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406697687] [2022-12-13 14:11:12,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406697687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:12,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:12,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832338867] [2022-12-13 14:11:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:12,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:12,480 INFO L87 Difference]: Start difference. First operand 325 states and 324 transitions. Second operand has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:12,936 INFO L93 Difference]: Finished difference Result 324 states and 323 transitions. [2022-12-13 14:11:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:12,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-12-13 14:11:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:12,939 INFO L225 Difference]: With dead ends: 324 [2022-12-13 14:11:12,939 INFO L226 Difference]: Without dead ends: 324 [2022-12-13 14:11:12,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:12,939 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 430 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:12,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 524 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-13 14:11:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-12-13 14:11:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 299 states have (on average 1.080267558528428) internal successors, (323), 323 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 323 transitions. [2022-12-13 14:11:12,941 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 323 transitions. Word has length 234 [2022-12-13 14:11:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:12,942 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 323 transitions. [2022-12-13 14:11:12,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 323 transitions. [2022-12-13 14:11:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-12-13 14:11:12,942 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:12,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:12,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 14:11:12,943 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 755593571, now seen corresponding path program 1 times [2022-12-13 14:11:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20956247] [2022-12-13 14:11:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:13,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:13,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20956247] [2022-12-13 14:11:13,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20956247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:13,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:13,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382637010] [2022-12-13 14:11:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:13,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:13,156 INFO L87 Difference]: Start difference. First operand 324 states and 323 transitions. Second operand has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:13,347 INFO L93 Difference]: Finished difference Result 323 states and 322 transitions. [2022-12-13 14:11:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2022-12-13 14:11:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:13,349 INFO L225 Difference]: With dead ends: 323 [2022-12-13 14:11:13,349 INFO L226 Difference]: Without dead ends: 323 [2022-12-13 14:11:13,349 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-12-13 14:11:13,350 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 169 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:13,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 399 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-13 14:11:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-12-13 14:11:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 299 states have (on average 1.0769230769230769) internal successors, (322), 322 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 322 transitions. [2022-12-13 14:11:13,353 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 322 transitions. Word has length 239 [2022-12-13 14:11:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:13,353 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 322 transitions. [2022-12-13 14:11:13,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 322 transitions. [2022-12-13 14:11:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-12-13 14:11:13,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:13,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:13,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 14:11:13,354 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:13,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash 755593572, now seen corresponding path program 1 times [2022-12-13 14:11:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:13,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128448996] [2022-12-13 14:11:13,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128448996] [2022-12-13 14:11:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128448996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:13,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:13,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792014579] [2022-12-13 14:11:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:13,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:13,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:13,903 INFO L87 Difference]: Start difference. First operand 323 states and 322 transitions. Second operand has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:14,363 INFO L93 Difference]: Finished difference Result 322 states and 321 transitions. [2022-12-13 14:11:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2022-12-13 14:11:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:14,364 INFO L225 Difference]: With dead ends: 322 [2022-12-13 14:11:14,364 INFO L226 Difference]: Without dead ends: 322 [2022-12-13 14:11:14,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:14,364 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 647 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:14,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 526 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-12-13 14:11:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-12-13 14:11:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 299 states have (on average 1.0735785953177257) internal successors, (321), 321 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 321 transitions. [2022-12-13 14:11:14,366 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 321 transitions. Word has length 239 [2022-12-13 14:11:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:14,367 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 321 transitions. [2022-12-13 14:11:14,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 321 transitions. [2022-12-13 14:11:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-13 14:11:14,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:14,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:14,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 14:11:14,368 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 858096925, now seen corresponding path program 1 times [2022-12-13 14:11:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:14,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483634100] [2022-12-13 14:11:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:14,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:14,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483634100] [2022-12-13 14:11:14,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483634100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:14,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192253298] [2022-12-13 14:11:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:14,587 INFO L87 Difference]: Start difference. First operand 322 states and 321 transitions. Second operand has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:14,775 INFO L93 Difference]: Finished difference Result 321 states and 320 transitions. [2022-12-13 14:11:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2022-12-13 14:11:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:14,777 INFO L225 Difference]: With dead ends: 321 [2022-12-13 14:11:14,777 INFO L226 Difference]: Without dead ends: 321 [2022-12-13 14:11:14,777 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-12-13 14:11:14,777 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 155 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:14,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 401 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-12-13 14:11:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-12-13 14:11:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 299 states have (on average 1.0702341137123745) internal successors, (320), 320 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 320 transitions. [2022-12-13 14:11:14,781 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 320 transitions. Word has length 244 [2022-12-13 14:11:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:14,781 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 320 transitions. [2022-12-13 14:11:14,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 320 transitions. [2022-12-13 14:11:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-12-13 14:11:14,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:14,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:14,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 14:11:14,782 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash 858096926, now seen corresponding path program 1 times [2022-12-13 14:11:14,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:14,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184107086] [2022-12-13 14:11:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:15,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184107086] [2022-12-13 14:11:15,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184107086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:15,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:15,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241435710] [2022-12-13 14:11:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:15,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:15,387 INFO L87 Difference]: Start difference. First operand 321 states and 320 transitions. Second operand has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:15,712 INFO L93 Difference]: Finished difference Result 320 states and 319 transitions. [2022-12-13 14:11:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2022-12-13 14:11:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:15,713 INFO L225 Difference]: With dead ends: 320 [2022-12-13 14:11:15,713 INFO L226 Difference]: Without dead ends: 320 [2022-12-13 14:11:15,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:15,714 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 634 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:15,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 528 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-12-13 14:11:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2022-12-13 14:11:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 299 states have (on average 1.0668896321070234) internal successors, (319), 319 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 319 transitions. [2022-12-13 14:11:15,718 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 319 transitions. Word has length 244 [2022-12-13 14:11:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:15,719 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 319 transitions. [2022-12-13 14:11:15,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 319 transitions. [2022-12-13 14:11:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-12-13 14:11:15,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:15,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:15,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 14:11:15,720 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:15,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360308, now seen corresponding path program 1 times [2022-12-13 14:11:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:15,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805469429] [2022-12-13 14:11:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:15,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805469429] [2022-12-13 14:11:15,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805469429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:15,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:15,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508270570] [2022-12-13 14:11:15,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:15,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:15,957 INFO L87 Difference]: Start difference. First operand 320 states and 319 transitions. Second operand has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:16,083 INFO L93 Difference]: Finished difference Result 319 states and 318 transitions. [2022-12-13 14:11:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2022-12-13 14:11:16,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:16,084 INFO L225 Difference]: With dead ends: 319 [2022-12-13 14:11:16,084 INFO L226 Difference]: Without dead ends: 319 [2022-12-13 14:11:16,084 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-12-13 14:11:16,085 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 141 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:16,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 403 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-12-13 14:11:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-12-13 14:11:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 299 states have (on average 1.0635451505016722) internal successors, (318), 318 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 318 transitions. [2022-12-13 14:11:16,087 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 318 transitions. Word has length 249 [2022-12-13 14:11:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:16,087 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 318 transitions. [2022-12-13 14:11:16,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 318 transitions. [2022-12-13 14:11:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-12-13 14:11:16,088 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:16,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:16,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 14:11:16,089 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360309, now seen corresponding path program 1 times [2022-12-13 14:11:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:16,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509882053] [2022-12-13 14:11:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:16,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:16,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509882053] [2022-12-13 14:11:16,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509882053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:16,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:16,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476341803] [2022-12-13 14:11:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:16,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:16,682 INFO L87 Difference]: Start difference. First operand 319 states and 318 transitions. Second operand has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:17,082 INFO L93 Difference]: Finished difference Result 318 states and 317 transitions. [2022-12-13 14:11:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:17,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2022-12-13 14:11:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:17,083 INFO L225 Difference]: With dead ends: 318 [2022-12-13 14:11:17,083 INFO L226 Difference]: Without dead ends: 318 [2022-12-13 14:11:17,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:17,083 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 397 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:17,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 530 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-12-13 14:11:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-12-13 14:11:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 299 states have (on average 1.060200668896321) internal successors, (317), 317 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 317 transitions. [2022-12-13 14:11:17,085 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 317 transitions. Word has length 249 [2022-12-13 14:11:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:17,086 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 317 transitions. [2022-12-13 14:11:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 317 transitions. [2022-12-13 14:11:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-12-13 14:11:17,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:17,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:17,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 14:11:17,087 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:17,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash 472395598, now seen corresponding path program 1 times [2022-12-13 14:11:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:17,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369929707] [2022-12-13 14:11:17,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:17,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-12-13 14:11:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369929707] [2022-12-13 14:11:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369929707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:17,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:17,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891646366] [2022-12-13 14:11:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:17,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:17,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:17,316 INFO L87 Difference]: Start difference. First operand 318 states and 317 transitions. Second operand has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:17,507 INFO L93 Difference]: Finished difference Result 317 states and 316 transitions. [2022-12-13 14:11:17,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:17,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-12-13 14:11:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:17,509 INFO L225 Difference]: With dead ends: 317 [2022-12-13 14:11:17,509 INFO L226 Difference]: Without dead ends: 317 [2022-12-13 14:11:17,509 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-12-13 14:11:17,509 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:17,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 405 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-12-13 14:11:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-12-13 14:11:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 299 states have (on average 1.0568561872909699) internal successors, (316), 316 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 316 transitions. [2022-12-13 14:11:17,513 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 316 transitions. Word has length 254 [2022-12-13 14:11:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:17,513 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 316 transitions. [2022-12-13 14:11:17,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 316 transitions. [2022-12-13 14:11:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-12-13 14:11:17,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:17,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:17,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 14:11:17,514 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 472395599, now seen corresponding path program 1 times [2022-12-13 14:11:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:17,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671408528] [2022-12-13 14:11:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:18,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671408528] [2022-12-13 14:11:18,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671408528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:18,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:18,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781192595] [2022-12-13 14:11:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:18,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:18,096 INFO L87 Difference]: Start difference. First operand 317 states and 316 transitions. Second operand has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:18,504 INFO L93 Difference]: Finished difference Result 316 states and 315 transitions. [2022-12-13 14:11:18,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:18,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-12-13 14:11:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:18,506 INFO L225 Difference]: With dead ends: 316 [2022-12-13 14:11:18,506 INFO L226 Difference]: Without dead ends: 316 [2022-12-13 14:11:18,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:18,506 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 450 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:18,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-12-13 14:11:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-12-13 14:11:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 299 states have (on average 1.0535117056856187) internal successors, (315), 315 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 315 transitions. [2022-12-13 14:11:18,508 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 315 transitions. Word has length 254 [2022-12-13 14:11:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:18,508 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 315 transitions. [2022-12-13 14:11:18,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 315 transitions. [2022-12-13 14:11:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-12-13 14:11:18,509 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:18,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:18,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 14:11:18,509 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:18,510 INFO L85 PathProgramCache]: Analyzing trace with hash 513697157, now seen corresponding path program 1 times [2022-12-13 14:11:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:18,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448937606] [2022-12-13 14:11:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:18,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448937606] [2022-12-13 14:11:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448937606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016538269] [2022-12-13 14:11:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:18,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:18,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:18,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:18,774 INFO L87 Difference]: Start difference. First operand 316 states and 315 transitions. Second operand has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:18,946 INFO L93 Difference]: Finished difference Result 315 states and 314 transitions. [2022-12-13 14:11:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2022-12-13 14:11:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:18,948 INFO L225 Difference]: With dead ends: 315 [2022-12-13 14:11:18,948 INFO L226 Difference]: Without dead ends: 315 [2022-12-13 14:11:18,948 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-12-13 14:11:18,948 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 113 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:18,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 407 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-12-13 14:11:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-12-13 14:11:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 299 states have (on average 1.0501672240802675) internal successors, (314), 314 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 314 transitions. [2022-12-13 14:11:18,950 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 314 transitions. Word has length 259 [2022-12-13 14:11:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:18,950 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 314 transitions. [2022-12-13 14:11:18,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 314 transitions. [2022-12-13 14:11:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-12-13 14:11:18,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:18,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:18,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 14:11:18,951 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 513697158, now seen corresponding path program 1 times [2022-12-13 14:11:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:18,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886550497] [2022-12-13 14:11:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:19,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886550497] [2022-12-13 14:11:19,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886550497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:19,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:19,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274399278] [2022-12-13 14:11:19,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:19,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:19,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:19,545 INFO L87 Difference]: Start difference. First operand 315 states and 314 transitions. Second operand has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:19,976 INFO L93 Difference]: Finished difference Result 314 states and 313 transitions. [2022-12-13 14:11:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:19,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2022-12-13 14:11:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:19,977 INFO L225 Difference]: With dead ends: 314 [2022-12-13 14:11:19,977 INFO L226 Difference]: Without dead ends: 314 [2022-12-13 14:11:19,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:19,977 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 375 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:19,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 534 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-12-13 14:11:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-12-13 14:11:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 299 states have (on average 1.0468227424749164) internal successors, (313), 313 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 313 transitions. [2022-12-13 14:11:19,979 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 313 transitions. Word has length 259 [2022-12-13 14:11:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:19,980 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 313 transitions. [2022-12-13 14:11:19,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 313 transitions. [2022-12-13 14:11:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-12-13 14:11:19,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:19,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:19,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 14:11:19,981 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:19,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325825, now seen corresponding path program 1 times [2022-12-13 14:11:19,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:19,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834308791] [2022-12-13 14:11:19,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:20,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834308791] [2022-12-13 14:11:20,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834308791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:20,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:20,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100684036] [2022-12-13 14:11:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:20,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:20,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:20,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:20,226 INFO L87 Difference]: Start difference. First operand 314 states and 313 transitions. Second operand has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:20,418 INFO L93 Difference]: Finished difference Result 313 states and 312 transitions. [2022-12-13 14:11:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-12-13 14:11:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:20,420 INFO L225 Difference]: With dead ends: 313 [2022-12-13 14:11:20,421 INFO L226 Difference]: Without dead ends: 313 [2022-12-13 14:11:20,421 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-12-13 14:11:20,421 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 99 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:20,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 409 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-12-13 14:11:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-12-13 14:11:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 299 states have (on average 1.0434782608695652) internal successors, (312), 312 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 312 transitions. [2022-12-13 14:11:20,424 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 312 transitions. Word has length 264 [2022-12-13 14:11:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:20,425 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 312 transitions. [2022-12-13 14:11:20,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 312 transitions. [2022-12-13 14:11:20,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-12-13 14:11:20,425 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:20,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:20,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 14:11:20,426 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325824, now seen corresponding path program 1 times [2022-12-13 14:11:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:20,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911071172] [2022-12-13 14:11:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:21,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911071172] [2022-12-13 14:11:21,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911071172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:21,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:21,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:21,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838407853] [2022-12-13 14:11:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:21,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:21,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:21,049 INFO L87 Difference]: Start difference. First operand 313 states and 312 transitions. Second operand has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:21,502 INFO L93 Difference]: Finished difference Result 312 states and 311 transitions. [2022-12-13 14:11:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-12-13 14:11:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:21,504 INFO L225 Difference]: With dead ends: 312 [2022-12-13 14:11:21,504 INFO L226 Difference]: Without dead ends: 312 [2022-12-13 14:11:21,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:21,504 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 582 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:21,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 536 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-13 14:11:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-12-13 14:11:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 299 states have (on average 1.040133779264214) internal successors, (311), 311 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 311 transitions. [2022-12-13 14:11:21,506 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 311 transitions. Word has length 264 [2022-12-13 14:11:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:21,506 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 311 transitions. [2022-12-13 14:11:21,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 311 transitions. [2022-12-13 14:11:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-12-13 14:11:21,507 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:21,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:21,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 14:11:21,507 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631702, now seen corresponding path program 1 times [2022-12-13 14:11:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:21,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129925886] [2022-12-13 14:11:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:21,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129925886] [2022-12-13 14:11:21,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129925886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:21,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:21,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148962211] [2022-12-13 14:11:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:21,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:21,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:21,814 INFO L87 Difference]: Start difference. First operand 312 states and 311 transitions. Second operand has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:21,987 INFO L93 Difference]: Finished difference Result 311 states and 310 transitions. [2022-12-13 14:11:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2022-12-13 14:11:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:21,989 INFO L225 Difference]: With dead ends: 311 [2022-12-13 14:11:21,989 INFO L226 Difference]: Without dead ends: 311 [2022-12-13 14:11:21,989 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-12-13 14:11:21,989 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 85 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:21,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 411 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-12-13 14:11:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-12-13 14:11:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 299 states have (on average 1.0367892976588629) internal successors, (310), 310 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 310 transitions. [2022-12-13 14:11:21,993 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 310 transitions. Word has length 269 [2022-12-13 14:11:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:21,993 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 310 transitions. [2022-12-13 14:11:21,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 310 transitions. [2022-12-13 14:11:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-12-13 14:11:21,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:21,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:21,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 14:11:21,994 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:21,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:21,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631703, now seen corresponding path program 1 times [2022-12-13 14:11:21,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:21,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152790921] [2022-12-13 14:11:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:22,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152790921] [2022-12-13 14:11:22,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152790921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:22,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:22,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416753041] [2022-12-13 14:11:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:22,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:22,771 INFO L87 Difference]: Start difference. First operand 311 states and 310 transitions. Second operand has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:23,217 INFO L93 Difference]: Finished difference Result 310 states and 309 transitions. [2022-12-13 14:11:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2022-12-13 14:11:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:23,218 INFO L225 Difference]: With dead ends: 310 [2022-12-13 14:11:23,218 INFO L226 Difference]: Without dead ends: 310 [2022-12-13 14:11:23,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:23,218 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 353 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:23,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 538 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-12-13 14:11:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-12-13 14:11:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.0334448160535117) internal successors, (309), 309 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 309 transitions. [2022-12-13 14:11:23,220 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 309 transitions. Word has length 269 [2022-12-13 14:11:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:23,220 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 309 transitions. [2022-12-13 14:11:23,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 309 transitions. [2022-12-13 14:11:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-12-13 14:11:23,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:23,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:23,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 14:11:23,221 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655216, now seen corresponding path program 1 times [2022-12-13 14:11:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634040178] [2022-12-13 14:11:23,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:23,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:23,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634040178] [2022-12-13 14:11:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634040178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:23,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711636167] [2022-12-13 14:11:23,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:23,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:23,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:23,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:23,467 INFO L87 Difference]: Start difference. First operand 310 states and 309 transitions. Second operand has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:23,637 INFO L93 Difference]: Finished difference Result 309 states and 308 transitions. [2022-12-13 14:11:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:23,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2022-12-13 14:11:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:23,639 INFO L225 Difference]: With dead ends: 309 [2022-12-13 14:11:23,639 INFO L226 Difference]: Without dead ends: 309 [2022-12-13 14:11:23,639 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-12-13 14:11:23,640 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 71 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:23,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 413 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-12-13 14:11:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-12-13 14:11:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 299 states have (on average 1.0301003344481605) internal successors, (308), 308 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 308 transitions. [2022-12-13 14:11:23,644 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 308 transitions. Word has length 274 [2022-12-13 14:11:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:23,644 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 308 transitions. [2022-12-13 14:11:23,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 308 transitions. [2022-12-13 14:11:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-12-13 14:11:23,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:23,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:23,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 14:11:23,646 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655217, now seen corresponding path program 1 times [2022-12-13 14:11:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:23,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186379396] [2022-12-13 14:11:23,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:24,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-12-13 14:11:24,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:24,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186379396] [2022-12-13 14:11:24,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186379396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:24,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:24,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:24,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096984435] [2022-12-13 14:11:24,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:24,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:24,409 INFO L87 Difference]: Start difference. First operand 309 states and 308 transitions. Second operand has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:24,793 INFO L93 Difference]: Finished difference Result 308 states and 307 transitions. [2022-12-13 14:11:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:24,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2022-12-13 14:11:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:24,795 INFO L225 Difference]: With dead ends: 308 [2022-12-13 14:11:24,795 INFO L226 Difference]: Without dead ends: 308 [2022-12-13 14:11:24,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:24,795 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 378 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:24,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 499 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-12-13 14:11:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-12-13 14:11:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.0267558528428093) internal successors, (307), 307 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 307 transitions. [2022-12-13 14:11:24,798 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 307 transitions. Word has length 274 [2022-12-13 14:11:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:24,798 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 307 transitions. [2022-12-13 14:11:24,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 307 transitions. [2022-12-13 14:11:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-12-13 14:11:24,798 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:24,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 14:11:24,799 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash -572741209, now seen corresponding path program 1 times [2022-12-13 14:11:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:24,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846293355] [2022-12-13 14:11:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:25,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:25,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846293355] [2022-12-13 14:11:25,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846293355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:25,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:25,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:25,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42982547] [2022-12-13 14:11:25,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:25,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:25,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:25,045 INFO L87 Difference]: Start difference. First operand 308 states and 307 transitions. Second operand has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:25,161 INFO L93 Difference]: Finished difference Result 307 states and 306 transitions. [2022-12-13 14:11:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2022-12-13 14:11:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:25,161 INFO L225 Difference]: With dead ends: 307 [2022-12-13 14:11:25,161 INFO L226 Difference]: Without dead ends: 307 [2022-12-13 14:11:25,161 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-12-13 14:11:25,162 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 57 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:25,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 415 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-13 14:11:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-12-13 14:11:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 299 states have (on average 1.0234113712374582) internal successors, (306), 306 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 306 transitions. [2022-12-13 14:11:25,164 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 306 transitions. Word has length 279 [2022-12-13 14:11:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:25,164 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 306 transitions. [2022-12-13 14:11:25,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 306 transitions. [2022-12-13 14:11:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-12-13 14:11:25,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:25,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:25,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 14:11:25,165 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash -572741208, now seen corresponding path program 1 times [2022-12-13 14:11:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:25,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220285805] [2022-12-13 14:11:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220285805] [2022-12-13 14:11:25,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220285805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:25,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:25,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842719358] [2022-12-13 14:11:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:25,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:25,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:25,820 INFO L87 Difference]: Start difference. First operand 307 states and 306 transitions. Second operand has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:26,215 INFO L93 Difference]: Finished difference Result 306 states and 305 transitions. [2022-12-13 14:11:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2022-12-13 14:11:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:26,216 INFO L225 Difference]: With dead ends: 306 [2022-12-13 14:11:26,216 INFO L226 Difference]: Without dead ends: 306 [2022-12-13 14:11:26,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:26,217 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 331 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:26,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 583 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-13 14:11:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-12-13 14:11:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 299 states have (on average 1.020066889632107) internal successors, (305), 305 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 305 transitions. [2022-12-13 14:11:26,219 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 305 transitions. Word has length 279 [2022-12-13 14:11:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:26,219 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 305 transitions. [2022-12-13 14:11:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 305 transitions. [2022-12-13 14:11:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-12-13 14:11:26,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:26,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:26,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 14:11:26,220 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 425407970, now seen corresponding path program 1 times [2022-12-13 14:11:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418552878] [2022-12-13 14:11:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:26,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418552878] [2022-12-13 14:11:26,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418552878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:26,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:26,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519703327] [2022-12-13 14:11:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:26,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:26,869 INFO L87 Difference]: Start difference. First operand 306 states and 305 transitions. Second operand has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:27,192 INFO L93 Difference]: Finished difference Result 305 states and 304 transitions. [2022-12-13 14:11:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:27,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2022-12-13 14:11:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:27,193 INFO L225 Difference]: With dead ends: 305 [2022-12-13 14:11:27,193 INFO L226 Difference]: Without dead ends: 305 [2022-12-13 14:11:27,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:27,194 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 323 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:27,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 544 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-12-13 14:11:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-12-13 14:11:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 299 states have (on average 1.0167224080267558) internal successors, (304), 304 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 304 transitions. [2022-12-13 14:11:27,196 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 304 transitions. Word has length 284 [2022-12-13 14:11:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:27,196 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 304 transitions. [2022-12-13 14:11:27,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 304 transitions. [2022-12-13 14:11:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-12-13 14:11:27,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:27,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:27,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 14:11:27,197 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash 425407969, now seen corresponding path program 1 times [2022-12-13 14:11:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:27,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25064375] [2022-12-13 14:11:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25064375] [2022-12-13 14:11:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25064375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:27,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:27,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301682858] [2022-12-13 14:11:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:27,473 INFO L87 Difference]: Start difference. First operand 305 states and 304 transitions. Second operand has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:27,631 INFO L93 Difference]: Finished difference Result 304 states and 303 transitions. [2022-12-13 14:11:27,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:27,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2022-12-13 14:11:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:27,632 INFO L225 Difference]: With dead ends: 304 [2022-12-13 14:11:27,632 INFO L226 Difference]: Without dead ends: 304 [2022-12-13 14:11:27,632 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-12-13 14:11:27,632 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 41 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:27,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 417 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-13 14:11:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-12-13 14:11:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 299 states have (on average 1.0133779264214047) internal successors, (303), 303 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 303 transitions. [2022-12-13 14:11:27,634 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 303 transitions. Word has length 284 [2022-12-13 14:11:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:27,634 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 303 transitions. [2022-12-13 14:11:27,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 303 transitions. [2022-12-13 14:11:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-12-13 14:11:27,635 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:27,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:27,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 14:11:27,636 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858440, now seen corresponding path program 1 times [2022-12-13 14:11:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133919791] [2022-12-13 14:11:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:27,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133919791] [2022-12-13 14:11:27,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133919791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:27,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:27,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876991515] [2022-12-13 14:11:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:27,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:27,884 INFO L87 Difference]: Start difference. First operand 304 states and 303 transitions. Second operand has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:28,032 INFO L93 Difference]: Finished difference Result 303 states and 302 transitions. [2022-12-13 14:11:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:28,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2022-12-13 14:11:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:28,033 INFO L225 Difference]: With dead ends: 303 [2022-12-13 14:11:28,033 INFO L226 Difference]: Without dead ends: 303 [2022-12-13 14:11:28,033 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-12-13 14:11:28,033 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 29 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:28,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 419 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:11:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-12-13 14:11:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-12-13 14:11:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.0100334448160535) internal successors, (302), 302 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 302 transitions. [2022-12-13 14:11:28,037 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 302 transitions. Word has length 289 [2022-12-13 14:11:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:28,037 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 302 transitions. [2022-12-13 14:11:28,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 302 transitions. [2022-12-13 14:11:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-12-13 14:11:28,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:28,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:28,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 14:11:28,039 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:28,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858439, now seen corresponding path program 1 times [2022-12-13 14:11:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:28,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743616302] [2022-12-13 14:11:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:28,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743616302] [2022-12-13 14:11:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743616302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:28,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:28,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:11:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792035880] [2022-12-13 14:11:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:28,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:11:28,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:11:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:11:28,713 INFO L87 Difference]: Start difference. First operand 303 states and 302 transitions. Second operand has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:29,118 INFO L93 Difference]: Finished difference Result 302 states and 301 transitions. [2022-12-13 14:11:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:29,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2022-12-13 14:11:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:29,119 INFO L225 Difference]: With dead ends: 302 [2022-12-13 14:11:29,119 INFO L226 Difference]: Without dead ends: 302 [2022-12-13 14:11:29,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:11:29,119 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 517 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:29,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 546 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-12-13 14:11:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-12-13 14:11:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 299 states have (on average 1.0066889632107023) internal successors, (301), 301 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 301 transitions. [2022-12-13 14:11:29,121 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 301 transitions. Word has length 289 [2022-12-13 14:11:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:29,122 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 301 transitions. [2022-12-13 14:11:29,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 301 transitions. [2022-12-13 14:11:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-12-13 14:11:29,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:29,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:29,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 14:11:29,123 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445102, now seen corresponding path program 1 times [2022-12-13 14:11:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:29,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894463837] [2022-12-13 14:11:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:29,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:29,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894463837] [2022-12-13 14:11:29,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894463837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:29,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:29,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:11:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913307749] [2022-12-13 14:11:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:29,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:11:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:11:29,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:11:29,389 INFO L87 Difference]: Start difference. First operand 302 states and 301 transitions. Second operand has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:29,574 INFO L93 Difference]: Finished difference Result 301 states and 300 transitions. [2022-12-13 14:11:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:11:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2022-12-13 14:11:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:29,576 INFO L225 Difference]: With dead ends: 301 [2022-12-13 14:11:29,576 INFO L226 Difference]: Without dead ends: 301 [2022-12-13 14:11:29,576 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-12-13 14:11:29,576 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:29,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:11:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-12-13 14:11:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-12-13 14:11:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 299 states have (on average 1.0033444816053512) internal successors, (300), 300 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 300 transitions. [2022-12-13 14:11:29,580 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 300 transitions. Word has length 294 [2022-12-13 14:11:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:29,580 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 300 transitions. [2022-12-13 14:11:29,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 300 transitions. [2022-12-13 14:11:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-12-13 14:11:29,582 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:29,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:29,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 14:11:29,582 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445101, now seen corresponding path program 1 times [2022-12-13 14:11:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:29,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121193868] [2022-12-13 14:11:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:30,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:30,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121193868] [2022-12-13 14:11:30,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121193868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:30,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:30,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:11:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590294863] [2022-12-13 14:11:30,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:30,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:11:30,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:30,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:11:30,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:11:30,261 INFO L87 Difference]: Start difference. First operand 301 states and 300 transitions. Second operand has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:30,567 INFO L93 Difference]: Finished difference Result 300 states and 299 transitions. [2022-12-13 14:11:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:11:30,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2022-12-13 14:11:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:30,569 INFO L225 Difference]: With dead ends: 300 [2022-12-13 14:11:30,569 INFO L226 Difference]: Without dead ends: 300 [2022-12-13 14:11:30,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:30,569 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 306 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:30,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 507 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:11:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-13 14:11:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-12-13 14:11:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.0) internal successors, (299), 299 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 299 transitions. [2022-12-13 14:11:30,571 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 299 transitions. Word has length 294 [2022-12-13 14:11:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:30,571 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 299 transitions. [2022-12-13 14:11:30,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 299 transitions. [2022-12-13 14:11:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-12-13 14:11:30,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:11:30,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 14:11:30,573 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-12-13 14:11:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:11:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash -922991286, now seen corresponding path program 1 times [2022-12-13 14:11:30,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:11:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045300972] [2022-12-13 14:11:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:11:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:11:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:11:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:11:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:11:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045300972] [2022-12-13 14:11:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045300972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:11:32,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:11:32,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:11:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614946480] [2022-12-13 14:11:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:11:32,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:11:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:11:32,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:11:32,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:11:32,060 INFO L87 Difference]: Start difference. First operand 300 states and 299 transitions. Second operand has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:11:32,517 INFO L93 Difference]: Finished difference Result 297 states and 296 transitions. [2022-12-13 14:11:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:11:32,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 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 299 [2022-12-13 14:11:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:11:32,517 INFO L225 Difference]: With dead ends: 297 [2022-12-13 14:11:32,517 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 14:11:32,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:11:32,518 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 219 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:11:32,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 705 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:11:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 14:11:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 14:11:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 14:11:32,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2022-12-13 14:11:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:11:32,519 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:11:32,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:11:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 14:11:32,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 168 remaining) [2022-12-13 14:11:32,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 168 remaining) [2022-12-13 14:11:32,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 168 remaining) [2022-12-13 14:11:32,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 168 remaining) [2022-12-13 14:11:32,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 168 remaining) [2022-12-13 14:11:32,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 168 remaining) [2022-12-13 14:11:32,526 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 168 remaining) [2022-12-13 14:11:32,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 168 remaining) [2022-12-13 14:11:32,528 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 168 remaining) [2022-12-13 14:11:32,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK (1 of 168 remaining) [2022-12-13 14:11:32,530 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK (0 of 168 remaining) [2022-12-13 14:11:32,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 14:11:32,533 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 14:11:32,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:11:32,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:11:32 BoogieIcfgContainer [2022-12-13 14:11:32,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:11:32,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:11:32,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:11:32,537 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:11:32,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:10:33" (3/4) ... [2022-12-13 14:11:32,539 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 14:11:32,558 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 210 nodes and edges [2022-12-13 14:11:32,559 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 14:11:32,560 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 14:11:32,562 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-13 14:11:32,563 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 14:11:32,564 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 14:11:32,565 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 14:11:32,797 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:11:32,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:11:32,797 INFO L158 Benchmark]: Toolchain (without parser) took 61496.36ms. Allocated memory was 130.0MB in the beginning and 570.4MB in the end (delta: 440.4MB). Free memory was 89.0MB in the beginning and 286.9MB in the end (delta: -197.9MB). Peak memory consumption was 240.9MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,798 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:11:32,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.67ms. Allocated memory is still 130.0MB. Free memory was 88.6MB in the beginning and 93.3MB in the end (delta: -4.7MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.51ms. Allocated memory is still 130.0MB. Free memory was 93.3MB in the beginning and 84.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,798 INFO L158 Benchmark]: Boogie Preprocessor took 59.42ms. Allocated memory is still 130.0MB. Free memory was 84.9MB in the beginning and 73.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,798 INFO L158 Benchmark]: RCFGBuilder took 1310.38ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 73.5MB in the beginning and 96.0MB in the end (delta: -22.5MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,798 INFO L158 Benchmark]: TraceAbstraction took 59289.27ms. Allocated memory was 157.3MB in the beginning and 570.4MB in the end (delta: 413.1MB). Free memory was 95.0MB in the beginning and 326.7MB in the end (delta: -231.7MB). Peak memory consumption was 180.4MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,799 INFO L158 Benchmark]: Witness Printer took 260.19ms. Allocated memory is still 570.4MB. Free memory was 326.7MB in the beginning and 286.9MB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 14:11:32,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 107.0MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.67ms. Allocated memory is still 130.0MB. Free memory was 88.6MB in the beginning and 93.3MB in the end (delta: -4.7MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.51ms. Allocated memory is still 130.0MB. Free memory was 93.3MB in the beginning and 84.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.42ms. Allocated memory is still 130.0MB. Free memory was 84.9MB in the beginning and 73.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1310.38ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 73.5MB in the beginning and 96.0MB in the end (delta: -22.5MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 59289.27ms. Allocated memory was 157.3MB in the beginning and 570.4MB in the end (delta: 413.1MB). Free memory was 95.0MB in the beginning and 326.7MB in the end (delta: -231.7MB). Peak memory consumption was 180.4MB. Max. memory is 16.1GB. * Witness Printer took 260.19ms. Allocated memory is still 570.4MB. Free memory was 326.7MB in the beginning and 286.9MB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1287]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 470 locations, 168 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 91, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44849 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44849 mSDsluCounter, 41545 SdHoareTripleChecker+Invalid, 20.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19419 mSDsCounter, 2028 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28887 IncrementalHoareTripleChecker+Invalid, 30915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2028 mSolverCounterUnsat, 22126 mSDtfsCounter, 28887 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=0, InterpolantAutomatonStates: 539, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 91 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 16665 NumberOfCodeBlocks, 16665 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 16574 ConstructedInterpolants, 0 QuantifiedInterpolants, 83472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 91 InterpolantComputations, 91 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 168 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 14:11:32,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a83f45eb-57fa-4bce-89dd-bfe2de725e91/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE