./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/tree-2.i --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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/tree-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/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 ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a --- 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 13:32:11,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:32:11,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:32:11,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:32:11,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:32:11,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:32:11,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:32:11,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:32:11,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:32:11,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:32:11,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:32:11,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:32:11,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:32:11,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:32:11,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:32:11,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:32:11,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:32:11,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:32:11,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:32:11,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:32:11,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:32:11,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:32:11,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:32:11,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:32:11,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:32:11,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:32:11,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:32:11,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:32:11,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:32:11,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:32:11,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:32:11,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:32:11,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:32:11,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:32:11,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:32:11,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:32:11,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:32:11,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:32:11,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:32:11,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:32:11,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:32:11,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 13:32:11,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:32:11,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:32:11,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:32:11,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:32:11,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:32:11,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:32:11,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:32:11,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:32:11,370 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:32:11,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:32:11,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:32:11,371 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:32:11,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:32:11,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:32:11,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:32:11,372 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:32:11,372 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:32:11,372 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:32:11,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:32:11,372 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:32:11,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:32:11,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:32:11,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:32:11,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:32:11,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:32:11,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:32:11,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:32:11,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:32:11,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:32:11,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:32:11,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:32:11,375 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:32:11,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:32:11,375 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:32:11,375 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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/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 -> ff6ec4010c0396675f743c4c0d5de68176a7292a1f0bcf6c389633f85d936d1a [2022-12-13 13:32:11,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:32:11,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:32:11,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:32:11,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:32:11,590 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:32:11,591 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/heap-manipulation/tree-2.i [2022-12-13 13:32:14,107 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:32:14,265 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:32:14,265 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/sv-benchmarks/c/heap-manipulation/tree-2.i [2022-12-13 13:32:14,273 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/data/a0f7672e6/0f4fa34207254f2c965dc78bc692f5bf/FLAG5f8a17a29 [2022-12-13 13:32:14,656 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/data/a0f7672e6/0f4fa34207254f2c965dc78bc692f5bf [2022-12-13 13:32:14,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:32:14,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:32:14,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:32:14,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:32:14,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:32:14,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:14,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bce1575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14, skipping insertion in model container [2022-12-13 13:32:14,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:14,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:32:14,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:32:14,911 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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2022-12-13 13:32:14,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:32:14,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:32:14,958 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_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/sv-benchmarks/c/heap-manipulation/tree-2.i[22626,22639] [2022-12-13 13:32:14,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:32:14,984 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:32:14,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14 WrapperNode [2022-12-13 13:32:14,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:32:14,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:32:14,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:32:14,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:32:14,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,016 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2022-12-13 13:32:15,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:32:15,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:32:15,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:32:15,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:32:15,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,037 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:32:15,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:32:15,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:32:15,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:32:15,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (1/1) ... [2022-12-13 13:32:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:32:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:32:15,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:32:15,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:32:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-12-13 13:32:15,098 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:32:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:32:15,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:32:15,183 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:32:15,184 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:32:15,473 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:32:15,480 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:32:15,480 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-12-13 13:32:15,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:32:15 BoogieIcfgContainer [2022-12-13 13:32:15,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:32:15,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:32:15,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:32:15,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:32:15,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:32:14" (1/3) ... [2022-12-13 13:32:15,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182f084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:32:15, skipping insertion in model container [2022-12-13 13:32:15,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:32:14" (2/3) ... [2022-12-13 13:32:15,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182f084c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:32:15, skipping insertion in model container [2022-12-13 13:32:15,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:32:15" (3/3) ... [2022-12-13 13:32:15,491 INFO L112 eAbstractionObserver]: Analyzing ICFG tree-2.i [2022-12-13 13:32:15,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:32:15,508 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 63 error locations. [2022-12-13 13:32:15,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:32:15,546 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;@5a25cd3d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:32:15,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 63 error locations. [2022-12-13 13:32:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 77 states have (on average 2.168831168831169) internal successors, (167), 143 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:32:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 13:32:15,553 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:15,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 13:32:15,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 31591658, now seen corresponding path program 1 times [2022-12-13 13:32:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:15,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198274675] [2022-12-13 13:32:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:15,682 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 13:32:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198274675] [2022-12-13 13:32:15,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198274675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:15,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:15,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:32:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73176394] [2022-12-13 13:32:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:32:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:15,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:32:15,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:32:15,715 INFO L87 Difference]: Start difference. First operand has 145 states, 77 states have (on average 2.168831168831169) internal successors, (167), 143 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:15,734 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-12-13 13:32:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:32:15,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-12-13 13:32:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:15,741 INFO L225 Difference]: With dead ends: 143 [2022-12-13 13:32:15,741 INFO L226 Difference]: Without dead ends: 141 [2022-12-13 13:32:15,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:32:15,745 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:15,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:32:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-13 13:32:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-12-13 13:32:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 139 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2022-12-13 13:32:15,771 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 5 [2022-12-13 13:32:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:15,771 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2022-12-13 13:32:15,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-12-13 13:32:15,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 13:32:15,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:15,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 13:32:15,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:32:15,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash 978320808, now seen corresponding path program 1 times [2022-12-13 13:32:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079020940] [2022-12-13 13:32:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:15,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 13:32:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:15,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079020940] [2022-12-13 13:32:15,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079020940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:15,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:15,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271234456] [2022-12-13 13:32:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:15,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:15,838 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:15,896 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-12-13 13:32:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:15,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-13 13:32:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:15,898 INFO L225 Difference]: With dead ends: 144 [2022-12-13 13:32:15,898 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 13:32:15,898 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 13:32:15,899 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 88 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:15,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 179 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:32:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 13:32:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-12-13 13:32:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 78 states have (on average 1.9615384615384615) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2022-12-13 13:32:15,906 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 6 [2022-12-13 13:32:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:15,907 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2022-12-13 13:32:15,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2022-12-13 13:32:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 13:32:15,907 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:15,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 13:32:15,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:32:15,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:15,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 978321707, now seen corresponding path program 1 times [2022-12-13 13:32:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:15,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666174900] [2022-12-13 13:32:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32: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 13:32:15,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:15,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666174900] [2022-12-13 13:32:15,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666174900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:15,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:15,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:32:15,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384134681] [2022-12-13 13:32:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:15,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:15,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:15,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:15,958 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:16,100 INFO L93 Difference]: Finished difference Result 219 states and 241 transitions. [2022-12-13 13:32:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:16,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-13 13:32:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:16,102 INFO L225 Difference]: With dead ends: 219 [2022-12-13 13:32:16,102 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 13:32:16,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,104 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 129 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:16,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 234 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 13:32:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 138. [2022-12-13 13:32:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2022-12-13 13:32:16,117 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 6 [2022-12-13 13:32:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:16,117 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2022-12-13 13:32:16,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2022-12-13 13:32:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 13:32:16,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:16,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 13:32:16,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:32:16,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 978321708, now seen corresponding path program 1 times [2022-12-13 13:32:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:16,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526257554] [2022-12-13 13:32:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,172 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 13:32:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526257554] [2022-12-13 13:32:16,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526257554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:16,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:16,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:32:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799883692] [2022-12-13 13:32:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,174 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:16,293 INFO L93 Difference]: Finished difference Result 240 states and 262 transitions. [2022-12-13 13:32:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:16,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-13 13:32:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:16,295 INFO L225 Difference]: With dead ends: 240 [2022-12-13 13:32:16,295 INFO L226 Difference]: Without dead ends: 240 [2022-12-13 13:32:16,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,297 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 124 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:16,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 264 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-12-13 13:32:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 150. [2022-12-13 13:32:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.768421052631579) internal successors, (168), 148 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 171 transitions. [2022-12-13 13:32:16,303 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 171 transitions. Word has length 6 [2022-12-13 13:32:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:16,303 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 171 transitions. [2022-12-13 13:32:16,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 171 transitions. [2022-12-13 13:32:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 13:32:16,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:16,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:16,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:32:16,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -493316198, now seen corresponding path program 1 times [2022-12-13 13:32:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954708505] [2022-12-13 13:32:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,321 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 13:32:16,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:16,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954708505] [2022-12-13 13:32:16,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954708505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:16,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:16,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:32:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868270871] [2022-12-13 13:32:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:16,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,323 INFO L87 Difference]: Start difference. First operand 150 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:16,398 INFO L93 Difference]: Finished difference Result 229 states and 259 transitions. [2022-12-13 13:32:16,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:16,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 13:32:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:16,400 INFO L225 Difference]: With dead ends: 229 [2022-12-13 13:32:16,400 INFO L226 Difference]: Without dead ends: 228 [2022-12-13 13:32:16,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,402 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 79 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:16,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 193 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-13 13:32:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 153. [2022-12-13 13:32:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7448979591836735) internal successors, (171), 151 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2022-12-13 13:32:16,406 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 9 [2022-12-13 13:32:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:16,407 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2022-12-13 13:32:16,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2022-12-13 13:32:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 13:32:16,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:16,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:16,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:32:16,407 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash -466102223, now seen corresponding path program 1 times [2022-12-13 13:32:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:16,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844905916] [2022-12-13 13:32:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,444 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 13:32:16,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844905916] [2022-12-13 13:32:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844905916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:16,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:16,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763762432] [2022-12-13 13:32:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:16,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:16,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,446 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:16,462 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2022-12-13 13:32:16,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:16,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 13:32:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:16,463 INFO L225 Difference]: With dead ends: 238 [2022-12-13 13:32:16,464 INFO L226 Difference]: Without dead ends: 238 [2022-12-13 13:32:16,464 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 13:32:16,464 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 91 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:16,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:32:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-12-13 13:32:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 157. [2022-12-13 13:32:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 155 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2022-12-13 13:32:16,469 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 9 [2022-12-13 13:32:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:16,469 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2022-12-13 13:32:16,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2022-12-13 13:32:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 13:32:16,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:16,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:16,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:32:16,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1630553122, now seen corresponding path program 1 times [2022-12-13 13:32:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:16,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503409580] [2022-12-13 13:32:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,521 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 13:32:16,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503409580] [2022-12-13 13:32:16,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503409580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:16,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:16,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:32:16,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090254291] [2022-12-13 13:32:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:16,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:16,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:16,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:32:16,523 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:16,562 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2022-12-13 13:32:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:32:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 13:32:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:16,563 INFO L225 Difference]: With dead ends: 162 [2022-12-13 13:32:16,563 INFO L226 Difference]: Without dead ends: 158 [2022-12-13 13:32:16,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:16,564 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:16,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 538 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:32:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-13 13:32:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-12-13 13:32:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7346938775510203) internal successors, (170), 151 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2022-12-13 13:32:16,567 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 11 [2022-12-13 13:32:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:16,568 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2022-12-13 13:32:16,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2022-12-13 13:32:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:32:16,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:16,568 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:16,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:32:16,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash 543499593, now seen corresponding path program 1 times [2022-12-13 13:32:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:16,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199059303] [2022-12-13 13:32:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:16,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199059303] [2022-12-13 13:32:16,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199059303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:16,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:16,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:32:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419843449] [2022-12-13 13:32:16,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:16,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:32:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:32:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:32:16,604 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:16,646 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2022-12-13 13:32:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:32:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 13:32:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:16,647 INFO L225 Difference]: With dead ends: 162 [2022-12-13 13:32:16,647 INFO L226 Difference]: Without dead ends: 162 [2022-12-13 13:32:16,647 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 13:32:16,648 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:16,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:32:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-13 13:32:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2022-12-13 13:32:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-12-13 13:32:16,654 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 18 [2022-12-13 13:32:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:16,654 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-12-13 13:32:16,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-12-13 13:32:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:32:16,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:16,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:16,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:32:16,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 570713568, now seen corresponding path program 1 times [2022-12-13 13:32:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:16,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126644578] [2022-12-13 13:32:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126644578] [2022-12-13 13:32:16,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126644578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132673568] [2022-12-13 13:32:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:32:16,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:16,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:32:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:16,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:32:16,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:16,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:32:16,945 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:32:16,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 13:32:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:16,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:17,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132673568] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:32:17,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:32:17,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-12-13 13:32:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408854861] [2022-12-13 13:32:17,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:32:17,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:32:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:17,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:32:17,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:17,088 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:17,233 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2022-12-13 13:32:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:32:17,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 13:32:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:17,234 INFO L225 Difference]: With dead ends: 195 [2022-12-13 13:32:17,234 INFO L226 Difference]: Without dead ends: 195 [2022-12-13 13:32:17,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:32:17,235 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 439 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:17,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 193 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-12-13 13:32:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 152. [2022-12-13 13:32:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 98 states have (on average 1.7142857142857142) internal successors, (168), 150 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 171 transitions. [2022-12-13 13:32:17,238 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 171 transitions. Word has length 18 [2022-12-13 13:32:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:17,238 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 171 transitions. [2022-12-13 13:32:17,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 171 transitions. [2022-12-13 13:32:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:32:17,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:17,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:17,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:32:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:17,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash 570713569, now seen corresponding path program 1 times [2022-12-13 13:32:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594020395] [2022-12-13 13:32:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594020395] [2022-12-13 13:32:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594020395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341307322] [2022-12-13 13:32:17,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:17,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:32:17,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:17,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:32:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:17,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:32:17,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:17,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:32:17,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:32:17,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:32:17,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 13:32:17,880 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:32:17,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 13:32:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:17,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:22,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341307322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:32:22,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:32:22,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 13:32:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74706841] [2022-12-13 13:32:22,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:32:22,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:32:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:32:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:32:22,191 INFO L87 Difference]: Start difference. First operand 152 states and 171 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:22,511 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2022-12-13 13:32:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:32:22,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 13:32:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:22,512 INFO L225 Difference]: With dead ends: 203 [2022-12-13 13:32:22,512 INFO L226 Difference]: Without dead ends: 203 [2022-12-13 13:32:22,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:32:22,513 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 430 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:22,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 214 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:32:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-13 13:32:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 151. [2022-12-13 13:32:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 98 states have (on average 1.7040816326530612) internal successors, (167), 149 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2022-12-13 13:32:22,518 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 18 [2022-12-13 13:32:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:22,518 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2022-12-13 13:32:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2022-12-13 13:32:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:32:22,519 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:22,519 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:22,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 13:32:22,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:22,720 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash -317039615, now seen corresponding path program 1 times [2022-12-13 13:32:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:22,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344015456] [2022-12-13 13:32:22,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:22,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344015456] [2022-12-13 13:32:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344015456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:22,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:22,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:32:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324779048] [2022-12-13 13:32:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:22,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:32:22,803 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:22,924 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-12-13 13:32:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:32:22,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 13:32:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:22,926 INFO L225 Difference]: With dead ends: 150 [2022-12-13 13:32:22,926 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 13:32:22,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:22,926 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 8 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:22,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 364 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 13:32:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-12-13 13:32:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.683673469387755) internal successors, (165), 148 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2022-12-13 13:32:22,930 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 19 [2022-12-13 13:32:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:22,930 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2022-12-13 13:32:22,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2022-12-13 13:32:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:32:22,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:22,930 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:32:22,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash -317039614, now seen corresponding path program 1 times [2022-12-13 13:32:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:22,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080283468] [2022-12-13 13:32:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 13:32:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:23,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080283468] [2022-12-13 13:32:23,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080283468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:23,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:23,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:32:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761743867] [2022-12-13 13:32:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:23,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:32:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:32:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:32:23,067 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:23,184 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2022-12-13 13:32:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:32:23,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 13:32:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:23,185 INFO L225 Difference]: With dead ends: 149 [2022-12-13 13:32:23,185 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 13:32:23,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:32:23,186 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 6 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:23,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 377 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 13:32:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-13 13:32:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.663265306122449) internal successors, (163), 147 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2022-12-13 13:32:23,190 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 19 [2022-12-13 13:32:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:23,190 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2022-12-13 13:32:23,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2022-12-13 13:32:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:32:23,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:23,191 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:23,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:32:23,191 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash -294047799, now seen corresponding path program 1 times [2022-12-13 13:32:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:23,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130050219] [2022-12-13 13:32:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:23,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130050219] [2022-12-13 13:32:23,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130050219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:23,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:23,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:32:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915593383] [2022-12-13 13:32:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:23,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:32:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:32:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:32:23,331 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:23,575 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2022-12-13 13:32:23,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:32:23,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 13:32:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:23,576 INFO L225 Difference]: With dead ends: 150 [2022-12-13 13:32:23,576 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 13:32:23,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:32:23,577 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:23,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 539 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:32:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 13:32:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-12-13 13:32:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.653061224489796) internal successors, (162), 147 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2022-12-13 13:32:23,581 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 22 [2022-12-13 13:32:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:23,581 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2022-12-13 13:32:23,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2022-12-13 13:32:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 13:32:23,582 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:23,582 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:23,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:32:23,583 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash -294047798, now seen corresponding path program 1 times [2022-12-13 13:32:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:23,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320014218] [2022-12-13 13:32:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:23,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:23,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320014218] [2022-12-13 13:32:23,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320014218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:23,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:23,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:32:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880699240] [2022-12-13 13:32:23,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:23,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:32:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:23,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:32:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:32:23,846 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:24,112 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2022-12-13 13:32:24,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:32:24,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 13:32:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:24,113 INFO L225 Difference]: With dead ends: 149 [2022-12-13 13:32:24,113 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 13:32:24,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:32:24,114 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:24,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 563 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:32:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 13:32:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-13 13:32:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 147 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-12-13 13:32:24,116 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 22 [2022-12-13 13:32:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:24,116 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-12-13 13:32:24,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-12-13 13:32:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 13:32:24,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:24,117 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:24,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:32:24,117 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1755349544, now seen corresponding path program 1 times [2022-12-13 13:32:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:24,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400632346] [2022-12-13 13:32:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:24,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:24,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400632346] [2022-12-13 13:32:24,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400632346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:24,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:24,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:32:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237642174] [2022-12-13 13:32:24,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:32:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:32:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:32:24,279 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:24,458 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-12-13 13:32:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:32:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 13:32:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:24,458 INFO L225 Difference]: With dead ends: 150 [2022-12-13 13:32:24,458 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 13:32:24,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:32:24,459 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:24,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 397 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:32:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 13:32:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-12-13 13:32:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6326530612244898) internal successors, (160), 147 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-12-13 13:32:24,461 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 25 [2022-12-13 13:32:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:24,462 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-12-13 13:32:24,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-12-13 13:32:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 13:32:24,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:24,462 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:24,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:32:24,462 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:24,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1755349545, now seen corresponding path program 1 times [2022-12-13 13:32:24,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172680204] [2022-12-13 13:32:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:24,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:24,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172680204] [2022-12-13 13:32:24,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172680204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:24,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:32:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459980042] [2022-12-13 13:32:24,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:24,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:32:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:32:24,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:32:24,709 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:24,991 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2022-12-13 13:32:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:32:24,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 13:32:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:24,992 INFO L225 Difference]: With dead ends: 149 [2022-12-13 13:32:24,992 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 13:32:24,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:32:24,993 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 46 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:24,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 565 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:32:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 13:32:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-13 13:32:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 147 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-12-13 13:32:24,997 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 25 [2022-12-13 13:32:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:24,997 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-12-13 13:32:24,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-12-13 13:32:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 13:32:24,998 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:24,998 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:24,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:32:24,998 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:24,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1903478128, now seen corresponding path program 1 times [2022-12-13 13:32:24,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:24,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678777745] [2022-12-13 13:32:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:25,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678777745] [2022-12-13 13:32:25,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678777745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:25,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:25,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:32:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307637404] [2022-12-13 13:32:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:25,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:32:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:32:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:32:25,215 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:25,457 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-12-13 13:32:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:32:25,458 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-13 13:32:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:25,458 INFO L225 Difference]: With dead ends: 151 [2022-12-13 13:32:25,458 INFO L226 Difference]: Without dead ends: 151 [2022-12-13 13:32:25,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:32:25,459 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 57 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:25,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 471 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:32:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-13 13:32:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-12-13 13:32:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-12-13 13:32:25,461 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 28 [2022-12-13 13:32:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:25,461 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-12-13 13:32:25,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-12-13 13:32:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 13:32:25,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:25,462 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:25,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:32:25,462 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:25,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:25,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1903478127, now seen corresponding path program 1 times [2022-12-13 13:32:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:25,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727226505] [2022-12-13 13:32:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:25,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727226505] [2022-12-13 13:32:25,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727226505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:32:25,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:32:25,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:32:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959775821] [2022-12-13 13:32:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:32:25,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:32:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:32:25,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:32:25,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:32:25,740 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:32:26,070 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-12-13 13:32:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:32:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-13 13:32:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:32:26,071 INFO L225 Difference]: With dead ends: 149 [2022-12-13 13:32:26,071 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 13:32:26,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:32:26,071 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:32:26,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 717 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:32:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 13:32:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-13 13:32:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6020408163265305) internal successors, (157), 147 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-12-13 13:32:26,074 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-12-13 13:32:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:32:26,074 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-12-13 13:32:26,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:32:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-12-13 13:32:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 13:32:26,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:32:26,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:32:26,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:32:26,075 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 60 more)] === [2022-12-13 13:32:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:32:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1030942896, now seen corresponding path program 1 times [2022-12-13 13:32:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:32:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071807581] [2022-12-13 13:32:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:32:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:32:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071807581] [2022-12-13 13:32:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071807581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:32:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594583991] [2022-12-13 13:32:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:32:26,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:32:26,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:32:26,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:32:26,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7913875-d6b1-424e-a6d4-3c11c70a2cc4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:32:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:32:26,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:32:26,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:32:26,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:32:26,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:32:26,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:32:26,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 13:32:26,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 13:32:26,752 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:32:26,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 13:32:26,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 13:32:26,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 13:32:26,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:32:26,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 13:32:26,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 13:32:26,865 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:32:26,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 13:32:26,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 13:32:26,925 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:32:26,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 13:32:26,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 13:32:26,982 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:32:26,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 13:32:26,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 13:32:27,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 13:32:27,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:32:27,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2022-12-13 13:32:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:32:27,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:32:27,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_#t~mem15#1.base| v_ArrVal_608) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse0) 0)))) is different from false [2022-12-13 13:32:27,041 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_607) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_608) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse1) 0)))) is different from false [2022-12-13 13:32:27,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_601))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse3 (store .cse4 .cse1 v_ArrVal_604))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_602) .cse1 v_ArrVal_603) .cse2 v_ArrVal_605) (select (select (store .cse3 .cse2 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_601))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)))) is different from false [2022-12-13 13:32:27,714 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| |c_ULTIMATE.start_create_tree_#t~malloc11#1.base|))) (.cse5 (+ |c_ULTIMATE.start_create_tree_~node~0#1.offset| 4))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_598 Int) (v_ArrVal_603 (Array Int Int)) (v_ArrVal_602 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_606 (Array Int Int))) (= (select (select (let ((.cse3 (store .cse4 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_601))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (let ((.cse2 (store .cse3 .cse0 v_ArrVal_604))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset| v_ArrVal_598)) |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_602) .cse0 v_ArrVal_603) .cse1 v_ArrVal_605) (select (select (store .cse2 .cse1 v_ArrVal_606) |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_607))))) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (store .cse4 |c_ULTIMATE.start_create_tree_#t~malloc11#1.base| v_ArrVal_601))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_604)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_606)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_create_tree_~node~0#1.base|) |c_ULTIMATE.start_create_tree_~node~0#1.offset|) v_ArrVal_608)) |c_ULTIMATE.start_create_tree_~node~0#1.base|) .cse5) 0)))) is different from false [2022-12-13 13:32:29,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:32:29,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 111 [2022-12-13 13:32:29,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:32:29,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1231184 treesize of output 982190 [2022-12-13 13:33:24,382 WARN L233 SmtUtils]: Spent 55.09s on a formula simplification. DAG size of input: 486 DAG size of output: 459 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 13:33:26,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:26,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 721430 treesize of output 687626 [2022-12-13 13:33:29,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:29,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 687626 treesize of output 612538 [2022-12-13 13:33:31,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:33:31,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 612538 treesize of output 559166 [2022-12-13 13:33:34,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 559166 treesize of output 557118