./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72afb7e2fef67e92af6cd96223794441a1933610ae2e28bcd8b3509d9f7d2eed --- 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-b5237d8 [2022-11-22 01:09:01,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:09:01,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:09:02,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:09:02,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:09:02,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:09:02,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:09:02,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:09:02,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:09:02,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:09:02,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:09:02,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:09:02,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:09:02,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:09:02,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:09:02,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:09:02,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:09:02,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:09:02,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:09:02,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:09:02,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:09:02,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:09:02,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:09:02,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:09:02,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:09:02,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:09:02,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:09:02,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:09:02,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:09:02,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:09:02,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:09:02,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:09:02,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:09:02,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:09:02,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:09:02,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:09:02,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:09:02,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:09:02,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:09:02,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:09:02,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:09:02,117 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 01:09:02,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:09:02,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:09:02,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:09:02,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:09:02,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:09:02,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:09:02,166 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:09:02,166 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:09:02,166 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:09:02,167 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:09:02,168 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:09:02,168 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:09:02,169 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:09:02,169 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:09:02,169 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:09:02,170 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:09:02,170 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:09:02,170 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:09:02,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:09:02,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:09:02,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:09:02,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:09:02,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:09:02,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:09:02,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:09:02,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:09:02,173 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:09:02,174 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:09:02,174 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:09:02,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:09:02,175 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:09:02,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:09:02,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:09:02,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:09:02,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:09:02,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:02,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:09:02,177 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:09:02,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:09:02,178 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:09:02,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:09:02,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:09:02,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/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_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba 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 -> Taipan 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 -> 72afb7e2fef67e92af6cd96223794441a1933610ae2e28bcd8b3509d9f7d2eed [2022-11-22 01:09:02,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:09:02,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:09:02,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:09:02,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:09:02,567 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:09:02,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/ldv-regression/test10.c [2022-11-22 01:09:05,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:09:05,960 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:09:05,961 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/sv-benchmarks/c/ldv-regression/test10.c [2022-11-22 01:09:05,968 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/data/0cb3c94da/fa51def209694085bcc7fb985db182e6/FLAG49bd69d3a [2022-11-22 01:09:05,984 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/data/0cb3c94da/fa51def209694085bcc7fb985db182e6 [2022-11-22 01:09:05,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:09:05,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:09:05,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:05,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:09:05,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:09:05,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:05" (1/1) ... [2022-11-22 01:09:05,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dca4ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:05, skipping insertion in model container [2022-11-22 01:09:05,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:09:05" (1/1) ... [2022-11-22 01:09:06,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:09:06,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:09:06,230 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_532791b3-e36d-415a-a27d-2322005fdd70/sv-benchmarks/c/ldv-regression/test10.c[715,728] [2022-11-22 01:09:06,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:06,251 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:09:06,268 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_532791b3-e36d-415a-a27d-2322005fdd70/sv-benchmarks/c/ldv-regression/test10.c[715,728] [2022-11-22 01:09:06,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:09:06,285 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:09:06,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06 WrapperNode [2022-11-22 01:09:06,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:09:06,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:09:06,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:09:06,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:09:06,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,326 INFO L138 Inliner]: procedures = 16, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-11-22 01:09:06,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:09:06,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:09:06,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:09:06,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:09:06,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:09:06,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:09:06,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:09:06,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:09:06,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (1/1) ... [2022-11-22 01:09:06,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:09:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:09:06,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:09:06,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:09:06,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:09:06,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 01:09:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:09:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:09:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:09:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:09:06,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:09:06,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:09:06,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:09:06,577 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:09:06,593 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:09:07,001 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:09:07,092 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:09:07,094 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:09:07,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:07 BoogieIcfgContainer [2022-11-22 01:09:07,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:09:07,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:09:07,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:09:07,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:09:07,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:09:05" (1/3) ... [2022-11-22 01:09:07,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458caca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:07, skipping insertion in model container [2022-11-22 01:09:07,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:09:06" (2/3) ... [2022-11-22 01:09:07,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458caca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:09:07, skipping insertion in model container [2022-11-22 01:09:07,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:07" (3/3) ... [2022-11-22 01:09:07,110 INFO L112 eAbstractionObserver]: Analyzing ICFG test10.c [2022-11-22 01:09:07,130 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:09:07,131 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-22 01:09:07,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:09:07,201 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@421a5f38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:09:07,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-11-22 01:09:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 22 states have (on average 2.727272727272727) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 01:09:07,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:07,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 01:09:07,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash 3755, now seen corresponding path program 1 times [2022-11-22 01:09:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:07,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364365342] [2022-11-22 01:09:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:07,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:07,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364365342] [2022-11-22 01:09:07,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364365342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:07,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:07,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:07,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275950440] [2022-11-22 01:09:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:07,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:07,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:07,615 INFO L87 Difference]: Start difference. First operand has 59 states, 22 states have (on average 2.727272727272727) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:07,739 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-11-22 01:09:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-22 01:09:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:07,766 INFO L225 Difference]: With dead ends: 57 [2022-11-22 01:09:07,766 INFO L226 Difference]: Without dead ends: 56 [2022-11-22 01:09:07,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:07,777 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:07,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 20 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-22 01:09:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-22 01:09:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-11-22 01:09:07,816 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 2 [2022-11-22 01:09:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:07,816 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-11-22 01:09:07,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-11-22 01:09:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 01:09:07,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:07,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 01:09:07,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:09:07,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash 3756, now seen corresponding path program 1 times [2022-11-22 01:09:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:07,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359022121] [2022-11-22 01:09:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:07,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:07,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359022121] [2022-11-22 01:09:07,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359022121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:07,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:07,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186707980] [2022-11-22 01:09:07,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:07,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:07,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:07,982 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,056 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-11-22 01:09:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-22 01:09:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,058 INFO L225 Difference]: With dead ends: 54 [2022-11-22 01:09:08,058 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 01:09:08,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,060 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:08,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 21 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 01:09:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 01:09:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-11-22 01:09:08,068 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 2 [2022-11-22 01:09:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,069 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-11-22 01:09:08,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-11-22 01:09:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:09:08,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:09:08,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:09:08,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 116381, now seen corresponding path program 1 times [2022-11-22 01:09:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258918056] [2022-11-22 01:09:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:08,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:08,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258918056] [2022-11-22 01:09:08,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258918056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:08,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:08,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786680392] [2022-11-22 01:09:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:08,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,162 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,234 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-11-22 01:09:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:08,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 01:09:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,236 INFO L225 Difference]: With dead ends: 53 [2022-11-22 01:09:08,236 INFO L226 Difference]: Without dead ends: 53 [2022-11-22 01:09:08,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,238 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 19 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:08,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 19 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-22 01:09:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-22 01:09:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 22 states have (on average 2.409090909090909) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-11-22 01:09:08,245 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 3 [2022-11-22 01:09:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,245 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-11-22 01:09:08,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-11-22 01:09:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-22 01:09:08,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-22 01:09:08,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:09:08,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash 116382, now seen corresponding path program 1 times [2022-11-22 01:09:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399759892] [2022-11-22 01:09:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:08,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399759892] [2022-11-22 01:09:08,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399759892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:08,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:08,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138400302] [2022-11-22 01:09:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:08,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:08,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:08,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,359 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,420 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-11-22 01:09:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:08,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-22 01:09:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,422 INFO L225 Difference]: With dead ends: 52 [2022-11-22 01:09:08,422 INFO L226 Difference]: Without dead ends: 52 [2022-11-22 01:09:08,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,424 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:08,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 20 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-22 01:09:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-22 01:09:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-11-22 01:09:08,430 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 3 [2022-11-22 01:09:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,431 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-11-22 01:09:08,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-11-22 01:09:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:09:08,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:09:08,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:09:08,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash 3610240, now seen corresponding path program 1 times [2022-11-22 01:09:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124619050] [2022-11-22 01:09:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:08,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:08,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124619050] [2022-11-22 01:09:08,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124619050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:08,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:08,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737880548] [2022-11-22 01:09:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:08,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:08,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,560 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,640 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-11-22 01:09:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 01:09:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,648 INFO L225 Difference]: With dead ends: 49 [2022-11-22 01:09:08,649 INFO L226 Difference]: Without dead ends: 49 [2022-11-22 01:09:08,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,652 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:08,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 16 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-22 01:09:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-22 01:09:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 22 states have (on average 2.227272727272727) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-11-22 01:09:08,672 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 4 [2022-11-22 01:09:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,673 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-11-22 01:09:08,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-11-22 01:09:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:09:08,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:09:08,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:09:08,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 3610241, now seen corresponding path program 1 times [2022-11-22 01:09:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124624934] [2022-11-22 01:09:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:08,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:08,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124624934] [2022-11-22 01:09:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124624934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:08,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:08,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626901958] [2022-11-22 01:09:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:08,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:08,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,886 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:08,943 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-11-22 01:09:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 01:09:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:08,945 INFO L225 Difference]: With dead ends: 46 [2022-11-22 01:09:08,945 INFO L226 Difference]: Without dead ends: 46 [2022-11-22 01:09:08,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:08,946 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:08,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-22 01:09:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-22 01:09:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 2.090909090909091) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-11-22 01:09:08,952 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 4 [2022-11-22 01:09:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:08,953 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-11-22 01:09:08,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-11-22 01:09:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:09:08,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:08,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:09:08,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:09:08,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 111917423, now seen corresponding path program 1 times [2022-11-22 01:09:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:08,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481242419] [2022-11-22 01:09:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:08,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:09,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:09,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481242419] [2022-11-22 01:09:09,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481242419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:09,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:09,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079476638] [2022-11-22 01:09:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:09,025 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 3 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-11-22 01:09:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:09,082 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-11-22 01:09:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-22 01:09:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:09,084 INFO L225 Difference]: With dead ends: 40 [2022-11-22 01:09:09,084 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 01:09:09,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:09,085 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:09,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 10 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 01:09:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-22 01:09:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-11-22 01:09:09,090 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 5 [2022-11-22 01:09:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:09,090 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-11-22 01:09:09,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-22 01:09:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-11-22 01:09:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:09:09,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:09,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:09:09,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:09:09,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:09,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash 111917424, now seen corresponding path program 1 times [2022-11-22 01:09:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:09,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170301293] [2022-11-22 01:09:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:09,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:09,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170301293] [2022-11-22 01:09:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170301293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:09,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:09,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004546866] [2022-11-22 01:09:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:09,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:09,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:09,188 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 3 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-11-22 01:09:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:09,236 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-11-22 01:09:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-11-22 01:09:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:09,238 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:09:09,238 INFO L226 Difference]: Without dead ends: 34 [2022-11-22 01:09:09,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:09,239 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:09,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-22 01:09:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-22 01:09:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-11-22 01:09:09,243 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 5 [2022-11-22 01:09:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:09,244 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-11-22 01:09:09,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-22 01:09:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-11-22 01:09:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:09:09,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:09,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:09,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:09:09,245 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1237383497, now seen corresponding path program 1 times [2022-11-22 01:09:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:09,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38855848] [2022-11-22 01:09:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:09,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38855848] [2022-11-22 01:09:09,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38855848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:09,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:09,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:09:09,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318092806] [2022-11-22 01:09:09,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:09,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:09,350 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:09,392 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-11-22 01:09:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-22 01:09:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:09,394 INFO L225 Difference]: With dead ends: 32 [2022-11-22 01:09:09,395 INFO L226 Difference]: Without dead ends: 32 [2022-11-22 01:09:09,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:09,398 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:09,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-22 01:09:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-22 01:09:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-11-22 01:09:09,405 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 8 [2022-11-22 01:09:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:09,406 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-11-22 01:09:09,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-11-22 01:09:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:09:09,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:09,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:09,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:09:09,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1237383498, now seen corresponding path program 1 times [2022-11-22 01:09:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:09,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818993322] [2022-11-22 01:09:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:09,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:09,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818993322] [2022-11-22 01:09:09,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818993322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:09,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:09,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:09:09,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390281856] [2022-11-22 01:09:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:09,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:09:09,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:09:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:09:09,625 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:09,697 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-22 01:09:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:09:09,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-22 01:09:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:09,698 INFO L225 Difference]: With dead ends: 31 [2022-11-22 01:09:09,698 INFO L226 Difference]: Without dead ends: 31 [2022-11-22 01:09:09,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:09,699 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:09,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 17 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-22 01:09:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-22 01:09:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-11-22 01:09:09,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-11-22 01:09:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:09,711 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-11-22 01:09:09,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-11-22 01:09:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:09:09,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:09,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:09:09,713 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash -295817260, now seen corresponding path program 1 times [2022-11-22 01:09:09,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:09,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513364898] [2022-11-22 01:09:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:09,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513364898] [2022-11-22 01:09:09,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513364898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:09,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:09,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:09:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113254050] [2022-11-22 01:09:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:09,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:09:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:09:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:09:09,812 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:09,858 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-11-22 01:09:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:09:09,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:09:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:09,860 INFO L225 Difference]: With dead ends: 30 [2022-11-22 01:09:09,861 INFO L226 Difference]: Without dead ends: 30 [2022-11-22 01:09:09,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:09,863 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:09,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 8 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-22 01:09:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-22 01:09:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-11-22 01:09:09,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 9 [2022-11-22 01:09:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:09,873 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-11-22 01:09:09,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-11-22 01:09:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:09:09,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:09,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:09,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:09:09,874 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -295817259, now seen corresponding path program 1 times [2022-11-22 01:09:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:09,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121984860] [2022-11-22 01:09:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:10,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121984860] [2022-11-22 01:09:10,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121984860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:10,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:10,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:09:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668889804] [2022-11-22 01:09:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:10,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:09:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:09:10,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:09:10,061 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 4 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-11-22 01:09:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:10,117 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-11-22 01:09:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:09:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-11-22 01:09:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:10,118 INFO L225 Difference]: With dead ends: 29 [2022-11-22 01:09:10,119 INFO L226 Difference]: Without dead ends: 29 [2022-11-22 01:09:10,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:10,120 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:10,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-22 01:09:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-22 01:09:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-11-22 01:09:10,126 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 9 [2022-11-22 01:09:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:10,126 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-11-22 01:09:10,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-11-22 01:09:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-11-22 01:09:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:09:10,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:10,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:10,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:09:10,128 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 884065221, now seen corresponding path program 1 times [2022-11-22 01:09:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693400603] [2022-11-22 01:09:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:10,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:10,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693400603] [2022-11-22 01:09:10,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693400603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:10,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:10,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:09:10,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423209604] [2022-11-22 01:09:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:10,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:09:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:09:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:09:10,354 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:10,425 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-11-22 01:09:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:09:10,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:09:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:10,426 INFO L225 Difference]: With dead ends: 28 [2022-11-22 01:09:10,427 INFO L226 Difference]: Without dead ends: 28 [2022-11-22 01:09:10,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:09:10,428 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:10,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-22 01:09:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-22 01:09:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-11-22 01:09:10,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 13 [2022-11-22 01:09:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:10,442 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-11-22 01:09:10,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-11-22 01:09:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:09:10,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:10,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:10,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:09:10,443 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:10,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:10,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1029991351, now seen corresponding path program 1 times [2022-11-22 01:09:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:10,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909780992] [2022-11-22 01:09:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:10,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:11,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:11,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909780992] [2022-11-22 01:09:11,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909780992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:11,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 01:09:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920996258] [2022-11-22 01:09:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:11,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:09:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:09:11,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:09:11,516 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:11,906 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-11-22 01:09:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:09:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:09:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:11,908 INFO L225 Difference]: With dead ends: 27 [2022-11-22 01:09:11,908 INFO L226 Difference]: Without dead ends: 27 [2022-11-22 01:09:11,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:09:11,909 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:11,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 13 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-22 01:09:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-22 01:09:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-22 01:09:11,912 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2022-11-22 01:09:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:11,913 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-22 01:09:11,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-22 01:09:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:09:11,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:11,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:11,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:09:11,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:11,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1029991352, now seen corresponding path program 1 times [2022-11-22 01:09:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819044129] [2022-11-22 01:09:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:13,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819044129] [2022-11-22 01:09:13,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819044129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:13,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:13,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-22 01:09:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280847402] [2022-11-22 01:09:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:13,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:09:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:09:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:09:13,379 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:13,886 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-11-22 01:09:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:09:13,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:09:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:13,888 INFO L225 Difference]: With dead ends: 26 [2022-11-22 01:09:13,888 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 01:09:13,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:09:13,889 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 81 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:13,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 16 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 01:09:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-22 01:09:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-11-22 01:09:13,890 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2022-11-22 01:09:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:13,891 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-11-22 01:09:13,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-11-22 01:09:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:09:13,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:13,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:13,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:09:13,892 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1979236306, now seen corresponding path program 1 times [2022-11-22 01:09:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:13,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407392630] [2022-11-22 01:09:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:14,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:14,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407392630] [2022-11-22 01:09:14,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407392630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:14,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:14,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 01:09:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011259601] [2022-11-22 01:09:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:14,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 01:09:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:14,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 01:09:14,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:09:14,248 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:14,533 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-11-22 01:09:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:09:14,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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-11-22 01:09:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:14,534 INFO L225 Difference]: With dead ends: 25 [2022-11-22 01:09:14,534 INFO L226 Difference]: Without dead ends: 25 [2022-11-22 01:09:14,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-22 01:09:14,535 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:14,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 8 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-22 01:09:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-22 01:09:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:14,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-22 01:09:14,537 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 19 [2022-11-22 01:09:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-22 01:09:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-22 01:09:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 01:09:14,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:14,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:14,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:09:14,539 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1979236307, now seen corresponding path program 1 times [2022-11-22 01:09:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:14,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736942270] [2022-11-22 01:09:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:15,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:15,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736942270] [2022-11-22 01:09:15,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736942270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:15,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:15,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 01:09:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614621322] [2022-11-22 01:09:15,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:15,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:09:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:09:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:09:15,456 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:16,057 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-11-22 01:09:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:09:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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-11-22 01:09:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:16,058 INFO L225 Difference]: With dead ends: 24 [2022-11-22 01:09:16,058 INFO L226 Difference]: Without dead ends: 24 [2022-11-22 01:09:16,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-22 01:09:16,059 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 81 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:16,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 14 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-22 01:09:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-22 01:09:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-11-22 01:09:16,061 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2022-11-22 01:09:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:16,061 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-11-22 01:09:16,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-11-22 01:09:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:09:16,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:16,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:16,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 01:09:16,062 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1226781682, now seen corresponding path program 1 times [2022-11-22 01:09:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:16,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894529606] [2022-11-22 01:09:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:17,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:17,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894529606] [2022-11-22 01:09:17,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894529606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:17,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:17,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-22 01:09:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322028636] [2022-11-22 01:09:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:17,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:09:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:09:17,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-22 01:09:17,118 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:17,665 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-11-22 01:09:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:09:17,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 01:09:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:17,666 INFO L225 Difference]: With dead ends: 24 [2022-11-22 01:09:17,666 INFO L226 Difference]: Without dead ends: 24 [2022-11-22 01:09:17,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-22 01:09:17,667 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 71 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:17,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 12 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-22 01:09:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-22 01:09:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2022-11-22 01:09:17,669 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 20 [2022-11-22 01:09:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:17,669 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2022-11-22 01:09:17,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-11-22 01:09:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:09:17,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:17,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:17,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 01:09:17,670 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -624395729, now seen corresponding path program 1 times [2022-11-22 01:09:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:17,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110305098] [2022-11-22 01:09:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:18,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:18,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110305098] [2022-11-22 01:09:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110305098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:18,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:18,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-22 01:09:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267851654] [2022-11-22 01:09:18,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:18,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:09:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:09:18,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:09:18,229 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:18,621 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-11-22 01:09:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 01:09:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-22 01:09:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:18,622 INFO L225 Difference]: With dead ends: 22 [2022-11-22 01:09:18,622 INFO L226 Difference]: Without dead ends: 22 [2022-11-22 01:09:18,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:09:18,623 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:18,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:09:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-22 01:09:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-22 01:09:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-11-22 01:09:18,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 21 [2022-11-22 01:09:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:18,625 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-11-22 01:09:18,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-11-22 01:09:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 01:09:18,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:09:18,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 01:09:18,626 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-11-22 01:09:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:09:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -624395664, now seen corresponding path program 1 times [2022-11-22 01:09:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:09:18,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604111484] [2022-11-22 01:09:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:09:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:09:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:09:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:09:18,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:09:18,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604111484] [2022-11-22 01:09:18,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604111484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:09:18,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:09:18,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:09:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474477215] [2022-11-22 01:09:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:09:18,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:09:18,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:09:18,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:09:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:18,679 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:09:18,707 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-11-22 01:09:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:09:18,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-22 01:09:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:09:18,708 INFO L225 Difference]: With dead ends: 21 [2022-11-22 01:09:18,708 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:09:18,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:09:18,709 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:09:18,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:09:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:09:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:09:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:09:18,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-22 01:09:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:09:18,712 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:09:18,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:09:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:09:18,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:09:18,715 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 36 remaining) [2022-11-22 01:09:18,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2022-11-22 01:09:18,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2022-11-22 01:09:18,716 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2022-11-22 01:09:18,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2022-11-22 01:09:18,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2022-11-22 01:09:18,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2022-11-22 01:09:18,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2022-11-22 01:09:18,717 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2022-11-22 01:09:18,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2022-11-22 01:09:18,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2022-11-22 01:09:18,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2022-11-22 01:09:18,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2022-11-22 01:09:18,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2022-11-22 01:09:18,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2022-11-22 01:09:18,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 36 remaining) [2022-11-22 01:09:18,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2022-11-22 01:09:18,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2022-11-22 01:09:18,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2022-11-22 01:09:18,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2022-11-22 01:09:18,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2022-11-22 01:09:18,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2022-11-22 01:09:18,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2022-11-22 01:09:18,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2022-11-22 01:09:18,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2022-11-22 01:09:18,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2022-11-22 01:09:18,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2022-11-22 01:09:18,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2022-11-22 01:09:18,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2022-11-22 01:09:18,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2022-11-22 01:09:18,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2022-11-22 01:09:18,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2022-11-22 01:09:18,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2022-11-22 01:09:18,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2022-11-22 01:09:18,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (1 of 36 remaining) [2022-11-22 01:09:18,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (0 of 36 remaining) [2022-11-22 01:09:18,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-22 01:09:18,727 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:09:18,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:09:18,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:09:18 BoogieIcfgContainer [2022-11-22 01:09:18,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:09:18,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:09:18,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:09:18,734 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:09:18,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:09:07" (3/4) ... [2022-11-22 01:09:18,737 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:09:18,748 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-22 01:09:18,748 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-22 01:09:18,749 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 01:09:18,749 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 01:09:18,797 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:09:18,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:09:18,798 INFO L158 Benchmark]: Toolchain (without parser) took 12810.42ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 74.9MB in the beginning and 154.6MB in the end (delta: -79.7MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2022-11-22 01:09:18,799 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory was 106.6MB in the beginning and 106.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:09:18,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.77ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 74.7MB in the beginning and 135.6MB in the end (delta: -60.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-11-22 01:09:18,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.33ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 134.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:09:18,806 INFO L158 Benchmark]: Boogie Preprocessor took 26.30ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:09:18,807 INFO L158 Benchmark]: RCFGBuilder took 743.63ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 113.3MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 01:09:18,807 INFO L158 Benchmark]: TraceAbstraction took 11632.92ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 112.5MB in the beginning and 158.8MB in the end (delta: -46.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-11-22 01:09:18,807 INFO L158 Benchmark]: Witness Printer took 64.16ms. Allocated memory is still 243.3MB. Free memory was 158.8MB in the beginning and 154.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:09:18,812 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory was 106.6MB in the beginning and 106.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.77ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 74.7MB in the beginning and 135.6MB in the end (delta: -60.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.33ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 134.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.30ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 743.63ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 113.3MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11632.92ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 112.5MB in the beginning and 158.8MB in the end (delta: -46.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 64.16ms. Allocated memory is still 243.3MB. Free memory was 158.8MB in the beginning and 154.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 999 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 999 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 971 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 209 mSDtfsCounter, 971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 2973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-22 01:09:18,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_532791b3-e36d-415a-a27d-2322005fdd70/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE