./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur --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 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:24:06,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:24:06,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:24:06,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:24:06,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:24:06,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:24:06,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:24:06,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:24:06,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:24:06,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:24:06,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:24:06,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:24:06,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:24:06,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:24:06,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:24:06,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:24:06,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:24:06,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:24:06,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:24:06,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:24:06,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:24:06,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:24:06,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:24:06,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:24:06,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:24:06,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:24:06,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:24:06,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:24:06,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:24:06,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:24:06,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:24:06,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:24:06,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:24:06,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:24:06,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:24:06,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:24:06,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:24:06,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:24:06,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:24:06,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:24:06,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:24:06,892 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:24:06,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:24:06,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:24:06,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:24:06,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:24:06,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:24:06,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:24:06,934 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:24:06,934 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:24:06,934 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:24:06,935 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:24:06,936 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:24:06,936 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:24:06,936 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:24:06,936 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:24:06,937 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:24:06,937 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:24:06,937 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:24:06,937 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:24:06,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:24:06,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:24:06,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:24:06,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:24:06,939 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:24:06,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:24:06,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:24:06,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:24:06,940 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:24:06,940 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:24:06,940 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:24:06,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:24:06,941 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:24:06,941 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:24:06,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:24:06,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:24:06,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:24:06,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:24:06,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:24:06,942 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:24:06,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:24:06,942 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:24:06,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:24:06,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:24:06,943 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_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/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_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2022-11-25 22:24:07,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:24:07,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:24:07,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:24:07,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:24:07,288 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:24:07,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-25 22:24:10,380 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:24:10,670 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:24:10,671 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2022-11-25 22:24:10,687 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/data/f90eebc85/b4e4d48d724a4af49f97ef9a93191d30/FLAG1716e333e [2022-11-25 22:24:10,702 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/data/f90eebc85/b4e4d48d724a4af49f97ef9a93191d30 [2022-11-25 22:24:10,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:24:10,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:24:10,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:24:10,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:24:10,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:24:10,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:24:10" (1/1) ... [2022-11-25 22:24:10,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:10, skipping insertion in model container [2022-11-25 22:24:10,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:24:10" (1/1) ... [2022-11-25 22:24:10,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:24:10,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:24:11,199 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-11-25 22:24:11,202 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-11-25 22:24:11,205 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-11-25 22:24:11,215 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_44881ac8-d9df-448d-bc2d-4ea7541c76e8/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-25 22:24:11,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:24:11,243 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:24:11,293 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-11-25 22:24:11,295 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-11-25 22:24:11,296 WARN L623 FunctionHandler]: Unknown extern function strncpy [2022-11-25 22:24:11,304 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_44881ac8-d9df-448d-bc2d-4ea7541c76e8/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i[36399,36412] [2022-11-25 22:24:11,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:24:11,346 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:24:11,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11 WrapperNode [2022-11-25 22:24:11,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:24:11,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:24:11,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:24:11,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:24:11,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,434 INFO L138 Inliner]: procedures = 184, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2022-11-25 22:24:11,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:24:11,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:24:11,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:24:11,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:24:11,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,477 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:24:11,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:24:11,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:24:11,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:24:11,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (1/1) ... [2022-11-25 22:24:11,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:24:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:24:11,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:24:11,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:24:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:24:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 22:24:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 22:24:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2022-11-25 22:24:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2022-11-25 22:24:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:24:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:24:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2022-11-25 22:24:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2022-11-25 22:24:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:24:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:24:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:24:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2022-11-25 22:24:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2022-11-25 22:24:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2022-11-25 22:24:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2022-11-25 22:24:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2022-11-25 22:24:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2022-11-25 22:24:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:24:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2022-11-25 22:24:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2022-11-25 22:24:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:24:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2022-11-25 22:24:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2022-11-25 22:24:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:24:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2022-11-25 22:24:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2022-11-25 22:24:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-25 22:24:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:24:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:24:11,896 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:24:11,898 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:24:12,967 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:24:13,051 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:24:13,051 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:24:13,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:24:13 BoogieIcfgContainer [2022-11-25 22:24:13,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:24:13,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:24:13,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:24:13,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:24:13,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:24:10" (1/3) ... [2022-11-25 22:24:13,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12373e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:24:13, skipping insertion in model container [2022-11-25 22:24:13,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:24:11" (2/3) ... [2022-11-25 22:24:13,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12373e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:24:13, skipping insertion in model container [2022-11-25 22:24:13,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:24:13" (3/3) ... [2022-11-25 22:24:13,071 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2022-11-25 22:24:13,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:24:13,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 162 error locations. [2022-11-25 22:24:13,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:24:13,162 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;@64c02008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:24:13,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2022-11-25 22:24:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 155 states have (on average 2.2) internal successors, (341), 317 states have internal predecessors, (341), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-25 22:24:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:24:13,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:13,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:24:13,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 582754168, now seen corresponding path program 1 times [2022-11-25 22:24:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:13,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871947752] [2022-11-25 22:24:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:13,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:13,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871947752] [2022-11-25 22:24:13,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871947752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:13,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:13,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:24:13,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094386986] [2022-11-25 22:24:13,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:13,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:24:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:24:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:13,604 INFO L87 Difference]: Start difference. First operand has 356 states, 155 states have (on average 2.2) internal successors, (341), 317 states have internal predecessors, (341), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:14,218 INFO L93 Difference]: Finished difference Result 381 states and 442 transitions. [2022-11-25 22:24:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:24:14,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2022-11-25 22:24:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:14,233 INFO L225 Difference]: With dead ends: 381 [2022-11-25 22:24:14,234 INFO L226 Difference]: Without dead ends: 380 [2022-11-25 22:24:14,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:14,239 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 355 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:14,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 235 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:24:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-25 22:24:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 351. [2022-11-25 22:24:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 169 states have (on average 2.0059171597633134) internal successors, (339), 307 states have internal predecessors, (339), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-25 22:24:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 408 transitions. [2022-11-25 22:24:14,306 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 408 transitions. Word has length 5 [2022-11-25 22:24:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:14,307 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 408 transitions. [2022-11-25 22:24:14,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 408 transitions. [2022-11-25 22:24:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:24:14,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:14,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:24:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:24:14,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 582754169, now seen corresponding path program 1 times [2022-11-25 22:24:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:14,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988115143] [2022-11-25 22:24:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:14,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:14,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988115143] [2022-11-25 22:24:14,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988115143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:14,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:14,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:24:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547013530] [2022-11-25 22:24:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:14,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:24:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:24:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:24:14,465 INFO L87 Difference]: Start difference. First operand 351 states and 408 transitions. Second operand has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:14,986 INFO L93 Difference]: Finished difference Result 431 states and 515 transitions. [2022-11-25 22:24:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:24:14,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2022-11-25 22:24:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:14,990 INFO L225 Difference]: With dead ends: 431 [2022-11-25 22:24:14,990 INFO L226 Difference]: Without dead ends: 431 [2022-11-25 22:24:14,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:24:14,992 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 125 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:14,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 547 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:24:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-25 22:24:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2022-11-25 22:24:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 218 states have (on average 1.8761467889908257) internal successors, (409), 352 states have internal predecessors, (409), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-25 22:24:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 505 transitions. [2022-11-25 22:24:15,037 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 505 transitions. Word has length 5 [2022-11-25 22:24:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:15,038 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 505 transitions. [2022-11-25 22:24:15,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 505 transitions. [2022-11-25 22:24:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:24:15,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:15,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:15,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:24:15,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 572059377, now seen corresponding path program 1 times [2022-11-25 22:24:15,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:15,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812137235] [2022-11-25 22:24:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:15,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:15,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:15,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812137235] [2022-11-25 22:24:15,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812137235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:15,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:15,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:24:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552022954] [2022-11-25 22:24:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:15,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:24:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:24:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:24:15,239 INFO L87 Difference]: Start difference. First operand 411 states and 505 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:15,741 INFO L93 Difference]: Finished difference Result 410 states and 504 transitions. [2022-11-25 22:24:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:24:15,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-25 22:24:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:15,744 INFO L225 Difference]: With dead ends: 410 [2022-11-25 22:24:15,744 INFO L226 Difference]: Without dead ends: 410 [2022-11-25 22:24:15,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:15,746 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 13 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:15,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 892 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:24:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-25 22:24:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-25 22:24:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 218 states have (on average 1.871559633027523) internal successors, (408), 351 states have internal predecessors, (408), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-25 22:24:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2022-11-25 22:24:15,780 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 8 [2022-11-25 22:24:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:15,781 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2022-11-25 22:24:15,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2022-11-25 22:24:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:24:15,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:15,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:15,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:24:15,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 572059378, now seen corresponding path program 1 times [2022-11-25 22:24:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:15,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596802781] [2022-11-25 22:24:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:15,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:16,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:16,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596802781] [2022-11-25 22:24:16,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596802781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:16,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:16,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:24:16,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691413438] [2022-11-25 22:24:16,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:16,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:24:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:16,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:24:16,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:24:16,109 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:16,711 INFO L93 Difference]: Finished difference Result 409 states and 503 transitions. [2022-11-25 22:24:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:24:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2022-11-25 22:24:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:16,718 INFO L225 Difference]: With dead ends: 409 [2022-11-25 22:24:16,720 INFO L226 Difference]: Without dead ends: 409 [2022-11-25 22:24:16,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:16,721 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:16,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 877 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:24:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-25 22:24:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2022-11-25 22:24:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 218 states have (on average 1.8669724770642202) internal successors, (407), 350 states have internal predecessors, (407), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-25 22:24:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 503 transitions. [2022-11-25 22:24:16,756 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 503 transitions. Word has length 8 [2022-11-25 22:24:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:16,757 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 503 transitions. [2022-11-25 22:24:16,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 503 transitions. [2022-11-25 22:24:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:24:16,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:16,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:16,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:24:16,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2077472333, now seen corresponding path program 1 times [2022-11-25 22:24:16,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:16,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760749078] [2022-11-25 22:24:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:16,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760749078] [2022-11-25 22:24:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760749078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:16,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:24:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522000304] [2022-11-25 22:24:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:16,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:24:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:24:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:16,860 INFO L87 Difference]: Start difference. First operand 409 states and 503 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:17,103 INFO L93 Difference]: Finished difference Result 408 states and 502 transitions. [2022-11-25 22:24:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:24:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-25 22:24:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:17,106 INFO L225 Difference]: With dead ends: 408 [2022-11-25 22:24:17,106 INFO L226 Difference]: Without dead ends: 408 [2022-11-25 22:24:17,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:17,107 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 2 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:17,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 518 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:24:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-25 22:24:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2022-11-25 22:24:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 218 states have (on average 1.8623853211009174) internal successors, (406), 349 states have internal predecessors, (406), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-25 22:24:17,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 502 transitions. [2022-11-25 22:24:17,133 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 502 transitions. Word has length 12 [2022-11-25 22:24:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:17,134 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 502 transitions. [2022-11-25 22:24:17,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 502 transitions. [2022-11-25 22:24:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:24:17,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:17,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:17,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:24:17,135 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2077472332, now seen corresponding path program 1 times [2022-11-25 22:24:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:17,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402705819] [2022-11-25 22:24:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:17,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:17,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402705819] [2022-11-25 22:24:17,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402705819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:17,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:17,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:24:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91899444] [2022-11-25 22:24:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:24:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:24:17,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:17,280 INFO L87 Difference]: Start difference. First operand 408 states and 502 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:17,549 INFO L93 Difference]: Finished difference Result 407 states and 501 transitions. [2022-11-25 22:24:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:24:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-25 22:24:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:17,552 INFO L225 Difference]: With dead ends: 407 [2022-11-25 22:24:17,552 INFO L226 Difference]: Without dead ends: 407 [2022-11-25 22:24:17,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:17,553 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:17,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:24:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-25 22:24:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-11-25 22:24:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 218 states have (on average 1.8577981651376148) internal successors, (405), 348 states have internal predecessors, (405), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2022-11-25 22:24:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 501 transitions. [2022-11-25 22:24:17,568 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 501 transitions. Word has length 12 [2022-11-25 22:24:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:17,568 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 501 transitions. [2022-11-25 22:24:17,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 501 transitions. [2022-11-25 22:24:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:24:17,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:17,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:17,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:24:17,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 578118043, now seen corresponding path program 1 times [2022-11-25 22:24:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:17,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140732082] [2022-11-25 22:24:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:17,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:17,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140732082] [2022-11-25 22:24:17,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140732082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:17,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:17,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952774271] [2022-11-25 22:24:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:17,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:17,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:17,747 INFO L87 Difference]: Start difference. First operand 407 states and 501 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:18,456 INFO L93 Difference]: Finished difference Result 437 states and 546 transitions. [2022-11-25 22:24:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:18,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-25 22:24:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:18,460 INFO L225 Difference]: With dead ends: 437 [2022-11-25 22:24:18,460 INFO L226 Difference]: Without dead ends: 437 [2022-11-25 22:24:18,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:18,461 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 44 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:18,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1269 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-25 22:24:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 426. [2022-11-25 22:24:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 233 states have (on average 1.832618025751073) internal successors, (427), 364 states have internal predecessors, (427), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-25 22:24:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2022-11-25 22:24:18,476 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 20 [2022-11-25 22:24:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:18,477 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2022-11-25 22:24:18,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2022-11-25 22:24:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:24:18,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:18,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:18,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:24:18,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 578118044, now seen corresponding path program 1 times [2022-11-25 22:24:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:18,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137559004] [2022-11-25 22:24:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:18,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:18,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137559004] [2022-11-25 22:24:18,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137559004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:18,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226528437] [2022-11-25 22:24:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:18,754 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:19,555 INFO L93 Difference]: Finished difference Result 436 states and 545 transitions. [2022-11-25 22:24:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:24:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-11-25 22:24:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:19,558 INFO L225 Difference]: With dead ends: 436 [2022-11-25 22:24:19,558 INFO L226 Difference]: Without dead ends: 436 [2022-11-25 22:24:19,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:19,559 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 38 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:19,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1217 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:24:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-11-25 22:24:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 426. [2022-11-25 22:24:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 233 states have (on average 1.8283261802575108) internal successors, (426), 364 states have internal predecessors, (426), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-25 22:24:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 527 transitions. [2022-11-25 22:24:19,577 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 527 transitions. Word has length 20 [2022-11-25 22:24:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:19,577 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 527 transitions. [2022-11-25 22:24:19,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 527 transitions. [2022-11-25 22:24:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:24:19,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:19,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:19,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:24:19,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:19,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 730721990, now seen corresponding path program 1 times [2022-11-25 22:24:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:19,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122875982] [2022-11-25 22:24:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:19,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:19,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122875982] [2022-11-25 22:24:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122875982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:19,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006402553] [2022-11-25 22:24:19,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:19,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:19,752 INFO L87 Difference]: Start difference. First operand 426 states and 527 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:20,492 INFO L93 Difference]: Finished difference Result 522 states and 663 transitions. [2022-11-25 22:24:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-25 22:24:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:20,496 INFO L225 Difference]: With dead ends: 522 [2022-11-25 22:24:20,496 INFO L226 Difference]: Without dead ends: 522 [2022-11-25 22:24:20,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:20,497 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 160 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:20,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1227 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:24:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-25 22:24:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 458. [2022-11-25 22:24:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 256 states have (on average 1.80859375) internal successors, (463), 390 states have internal predecessors, (463), 49 states have call successors, (49), 24 states have call predecessors, (49), 24 states have return successors, (70), 43 states have call predecessors, (70), 49 states have call successors, (70) [2022-11-25 22:24:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 582 transitions. [2022-11-25 22:24:20,524 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 582 transitions. Word has length 21 [2022-11-25 22:24:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:20,525 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 582 transitions. [2022-11-25 22:24:20,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 582 transitions. [2022-11-25 22:24:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 22:24:20,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:20,526 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-25 22:24:20,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:24:20,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 730721991, now seen corresponding path program 1 times [2022-11-25 22:24:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:20,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276820291] [2022-11-25 22:24:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:20,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:20,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276820291] [2022-11-25 22:24:20,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276820291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:20,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:20,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:20,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709452406] [2022-11-25 22:24:20,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:20,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:20,853 INFO L87 Difference]: Start difference. First operand 458 states and 582 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:21,605 INFO L93 Difference]: Finished difference Result 467 states and 594 transitions. [2022-11-25 22:24:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:24:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-25 22:24:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:21,608 INFO L225 Difference]: With dead ends: 467 [2022-11-25 22:24:21,608 INFO L226 Difference]: Without dead ends: 467 [2022-11-25 22:24:21,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:21,609 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 35 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:21,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1217 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:24:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-11-25 22:24:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 458. [2022-11-25 22:24:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 256 states have (on average 1.8046875) internal successors, (462), 390 states have internal predecessors, (462), 49 states have call successors, (49), 24 states have call predecessors, (49), 24 states have return successors, (70), 43 states have call predecessors, (70), 49 states have call successors, (70) [2022-11-25 22:24:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 581 transitions. [2022-11-25 22:24:21,624 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 581 transitions. Word has length 21 [2022-11-25 22:24:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:21,625 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 581 transitions. [2022-11-25 22:24:21,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 581 transitions. [2022-11-25 22:24:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:24:21,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:21,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] [2022-11-25 22:24:21,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:24:21,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 629327487, now seen corresponding path program 1 times [2022-11-25 22:24:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:21,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81609848] [2022-11-25 22:24:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:21,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:21,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81609848] [2022-11-25 22:24:21,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81609848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:21,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:21,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:24:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844061726] [2022-11-25 22:24:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:24:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:21,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:24:21,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:24:21,988 INFO L87 Difference]: Start difference. First operand 458 states and 581 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:23,438 INFO L93 Difference]: Finished difference Result 672 states and 915 transitions. [2022-11-25 22:24:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:24:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-11-25 22:24:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:23,443 INFO L225 Difference]: With dead ends: 672 [2022-11-25 22:24:23,444 INFO L226 Difference]: Without dead ends: 672 [2022-11-25 22:24:23,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 22:24:23,445 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 703 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:23,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 810 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 22:24:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-11-25 22:24:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 563. [2022-11-25 22:24:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 332 states have (on average 1.7018072289156627) internal successors, (565), 467 states have internal predecessors, (565), 63 states have call successors, (63), 30 states have call predecessors, (63), 39 states have return successors, (138), 65 states have call predecessors, (138), 63 states have call successors, (138) [2022-11-25 22:24:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 766 transitions. [2022-11-25 22:24:23,478 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 766 transitions. Word has length 20 [2022-11-25 22:24:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:23,478 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 766 transitions. [2022-11-25 22:24:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 766 transitions. [2022-11-25 22:24:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:24:23,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:23,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:23,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:24:23,483 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1166987801, now seen corresponding path program 1 times [2022-11-25 22:24:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225901089] [2022-11-25 22:24:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:23,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:23,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225901089] [2022-11-25 22:24:23,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225901089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:23,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:23,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475305270] [2022-11-25 22:24:23,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:23,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:23,800 INFO L87 Difference]: Start difference. First operand 563 states and 766 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:24,537 INFO L93 Difference]: Finished difference Result 637 states and 892 transitions. [2022-11-25 22:24:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-25 22:24:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:24,541 INFO L225 Difference]: With dead ends: 637 [2022-11-25 22:24:24,541 INFO L226 Difference]: Without dead ends: 637 [2022-11-25 22:24:24,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:24,542 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 48 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:24,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1213 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:24:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-25 22:24:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2022-11-25 22:24:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 377 states have (on average 1.663129973474801) internal successors, (627), 516 states have internal predecessors, (627), 70 states have call successors, (70), 34 states have call predecessors, (70), 48 states have return successors, (170), 73 states have call predecessors, (170), 70 states have call successors, (170) [2022-11-25 22:24:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 867 transitions. [2022-11-25 22:24:24,566 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 867 transitions. Word has length 22 [2022-11-25 22:24:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:24,568 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 867 transitions. [2022-11-25 22:24:24,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 867 transitions. [2022-11-25 22:24:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:24:24,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:24,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:24,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 22:24:24,569 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1166987800, now seen corresponding path program 1 times [2022-11-25 22:24:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:24,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362796147] [2022-11-25 22:24:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:24,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:24,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362796147] [2022-11-25 22:24:24,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362796147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:24,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:24,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799792327] [2022-11-25 22:24:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:24,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:24,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:24,784 INFO L87 Difference]: Start difference. First operand 624 states and 867 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:25,472 INFO L93 Difference]: Finished difference Result 753 states and 1089 transitions. [2022-11-25 22:24:25,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:25,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-25 22:24:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:25,477 INFO L225 Difference]: With dead ends: 753 [2022-11-25 22:24:25,477 INFO L226 Difference]: Without dead ends: 753 [2022-11-25 22:24:25,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:25,478 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 105 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:25,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1244 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-11-25 22:24:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 702. [2022-11-25 22:24:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 439 states have (on average 1.6264236902050113) internal successors, (714), 581 states have internal predecessors, (714), 73 states have call successors, (73), 40 states have call predecessors, (73), 61 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2022-11-25 22:24:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 988 transitions. [2022-11-25 22:24:25,506 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 988 transitions. Word has length 22 [2022-11-25 22:24:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:25,506 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 988 transitions. [2022-11-25 22:24:25,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 988 transitions. [2022-11-25 22:24:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:24:25,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:25,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:25,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 22:24:25,508 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1806107075, now seen corresponding path program 1 times [2022-11-25 22:24:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:25,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763476580] [2022-11-25 22:24:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:25,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:25,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763476580] [2022-11-25 22:24:25,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763476580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:25,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:25,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507187036] [2022-11-25 22:24:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:25,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:25,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:25,659 INFO L87 Difference]: Start difference. First operand 702 states and 988 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:26,323 INFO L93 Difference]: Finished difference Result 831 states and 1229 transitions. [2022-11-25 22:24:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-25 22:24:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:26,329 INFO L225 Difference]: With dead ends: 831 [2022-11-25 22:24:26,329 INFO L226 Difference]: Without dead ends: 831 [2022-11-25 22:24:26,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:26,330 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 80 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:26,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1249 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-25 22:24:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 782. [2022-11-25 22:24:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 503 states have (on average 1.6043737574552683) internal successors, (807), 651 states have internal predecessors, (807), 76 states have call successors, (76), 44 states have call predecessors, (76), 74 states have return successors, (232), 86 states have call predecessors, (232), 76 states have call successors, (232) [2022-11-25 22:24:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1115 transitions. [2022-11-25 22:24:26,366 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1115 transitions. Word has length 23 [2022-11-25 22:24:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:26,368 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1115 transitions. [2022-11-25 22:24:26,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1115 transitions. [2022-11-25 22:24:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:24:26,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:26,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:26,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 22:24:26,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1806107076, now seen corresponding path program 1 times [2022-11-25 22:24:26,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:26,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618256891] [2022-11-25 22:24:26,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:26,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:26,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:26,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618256891] [2022-11-25 22:24:26,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618256891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:26,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:26,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173921596] [2022-11-25 22:24:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:26,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:26,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:26,649 INFO L87 Difference]: Start difference. First operand 782 states and 1115 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:27,399 INFO L93 Difference]: Finished difference Result 876 states and 1283 transitions. [2022-11-25 22:24:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-25 22:24:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:27,405 INFO L225 Difference]: With dead ends: 876 [2022-11-25 22:24:27,405 INFO L226 Difference]: Without dead ends: 876 [2022-11-25 22:24:27,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:27,406 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 61 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:27,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1213 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:24:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-11-25 22:24:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 856. [2022-11-25 22:24:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 560 states have (on average 1.582142857142857) internal successors, (886), 712 states have internal predecessors, (886), 83 states have call successors, (83), 48 states have call predecessors, (83), 84 states have return successors, (267), 95 states have call predecessors, (267), 83 states have call successors, (267) [2022-11-25 22:24:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1236 transitions. [2022-11-25 22:24:27,440 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1236 transitions. Word has length 23 [2022-11-25 22:24:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:27,440 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 1236 transitions. [2022-11-25 22:24:27,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1236 transitions. [2022-11-25 22:24:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 22:24:27,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:27,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 22:24:27,442 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2020875180, now seen corresponding path program 1 times [2022-11-25 22:24:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:27,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402147589] [2022-11-25 22:24:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:27,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:27,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402147589] [2022-11-25 22:24:27,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402147589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:27,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:27,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 22:24:27,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866014846] [2022-11-25 22:24:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:27,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:24:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:24:27,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:27,789 INFO L87 Difference]: Start difference. First operand 856 states and 1236 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:28,297 INFO L93 Difference]: Finished difference Result 812 states and 1161 transitions. [2022-11-25 22:24:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:24:28,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-25 22:24:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:28,302 INFO L225 Difference]: With dead ends: 812 [2022-11-25 22:24:28,302 INFO L226 Difference]: Without dead ends: 812 [2022-11-25 22:24:28,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:24:28,303 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 38 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:28,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2260 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:24:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-25 22:24:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 789. [2022-11-25 22:24:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 512 states have (on average 1.607421875) internal successors, (823), 658 states have internal predecessors, (823), 77 states have call successors, (77), 45 states have call predecessors, (77), 71 states have return successors, (225), 85 states have call predecessors, (225), 77 states have call successors, (225) [2022-11-25 22:24:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1125 transitions. [2022-11-25 22:24:28,334 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1125 transitions. Word has length 25 [2022-11-25 22:24:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:28,334 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1125 transitions. [2022-11-25 22:24:28,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:24:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1125 transitions. [2022-11-25 22:24:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:24:28,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:28,335 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:28,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 22:24:28,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:28,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash -315897385, now seen corresponding path program 1 times [2022-11-25 22:24:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:28,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646542158] [2022-11-25 22:24:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:24:28,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:28,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646542158] [2022-11-25 22:24:28,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646542158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:28,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:28,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:24:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394812752] [2022-11-25 22:24:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:28,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:24:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:24:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:24:28,420 INFO L87 Difference]: Start difference. First operand 789 states and 1125 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:28,725 INFO L93 Difference]: Finished difference Result 787 states and 1123 transitions. [2022-11-25 22:24:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:24:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-25 22:24:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:28,730 INFO L225 Difference]: With dead ends: 787 [2022-11-25 22:24:28,730 INFO L226 Difference]: Without dead ends: 787 [2022-11-25 22:24:28,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:24:28,731 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 33 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:28,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 689 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:24:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-11-25 22:24:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2022-11-25 22:24:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 512 states have (on average 1.603515625) internal successors, (821), 656 states have internal predecessors, (821), 77 states have call successors, (77), 45 states have call predecessors, (77), 71 states have return successors, (225), 85 states have call predecessors, (225), 77 states have call successors, (225) [2022-11-25 22:24:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1123 transitions. [2022-11-25 22:24:28,777 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1123 transitions. Word has length 27 [2022-11-25 22:24:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:28,778 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1123 transitions. [2022-11-25 22:24:28,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1123 transitions. [2022-11-25 22:24:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:24:28,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:28,779 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:28,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 22:24:28,779 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash -315897384, now seen corresponding path program 1 times [2022-11-25 22:24:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:28,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844752760] [2022-11-25 22:24:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:24:29,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844752760] [2022-11-25 22:24:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844752760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:24:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100656140] [2022-11-25 22:24:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:29,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:24:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:24:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:24:29,072 INFO L87 Difference]: Start difference. First operand 787 states and 1123 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:29,533 INFO L93 Difference]: Finished difference Result 796 states and 1139 transitions. [2022-11-25 22:24:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-25 22:24:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:29,539 INFO L225 Difference]: With dead ends: 796 [2022-11-25 22:24:29,539 INFO L226 Difference]: Without dead ends: 796 [2022-11-25 22:24:29,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:24:29,541 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 35 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:29,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1941 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:24:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-11-25 22:24:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 787. [2022-11-25 22:24:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 512 states have (on average 1.6015625) internal successors, (820), 656 states have internal predecessors, (820), 77 states have call successors, (77), 45 states have call predecessors, (77), 71 states have return successors, (225), 85 states have call predecessors, (225), 77 states have call successors, (225) [2022-11-25 22:24:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1122 transitions. [2022-11-25 22:24:29,569 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1122 transitions. Word has length 27 [2022-11-25 22:24:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:29,569 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1122 transitions. [2022-11-25 22:24:29,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1122 transitions. [2022-11-25 22:24:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 22:24:29,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:29,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:29,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 22:24:29,571 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -188634323, now seen corresponding path program 1 times [2022-11-25 22:24:29,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417074936] [2022-11-25 22:24:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:29,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:29,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417074936] [2022-11-25 22:24:29,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417074936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:29,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:29,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 22:24:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961486683] [2022-11-25 22:24:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:29,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:24:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:24:29,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:29,898 INFO L87 Difference]: Start difference. First operand 787 states and 1122 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:31,410 INFO L93 Difference]: Finished difference Result 589 states and 784 transitions. [2022-11-25 22:24:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 22:24:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-25 22:24:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:31,413 INFO L225 Difference]: With dead ends: 589 [2022-11-25 22:24:31,414 INFO L226 Difference]: Without dead ends: 589 [2022-11-25 22:24:31,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2022-11-25 22:24:31,415 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 764 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:31,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 840 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 22:24:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-25 22:24:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 485. [2022-11-25 22:24:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 280 states have (on average 1.7714285714285714) internal successors, (496), 412 states have internal predecessors, (496), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (103), 45 states have call predecessors, (103), 49 states have call successors, (103) [2022-11-25 22:24:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 648 transitions. [2022-11-25 22:24:31,434 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 648 transitions. Word has length 25 [2022-11-25 22:24:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:31,435 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 648 transitions. [2022-11-25 22:24:31,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 648 transitions. [2022-11-25 22:24:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:24:31,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:31,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:31,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 22:24:31,436 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1707754842, now seen corresponding path program 1 times [2022-11-25 22:24:31,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:31,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135748658] [2022-11-25 22:24:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:31,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:31,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135748658] [2022-11-25 22:24:31,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135748658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:31,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:31,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:24:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257556317] [2022-11-25 22:24:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:31,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:24:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:24:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:24:31,584 INFO L87 Difference]: Start difference. First operand 485 states and 648 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:31,740 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2022-11-25 22:24:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:24:31,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 22:24:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:31,743 INFO L225 Difference]: With dead ends: 483 [2022-11-25 22:24:31,743 INFO L226 Difference]: Without dead ends: 475 [2022-11-25 22:24:31,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:24:31,745 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 11 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:31,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 897 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:24:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-25 22:24:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-25 22:24:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 273 states have (on average 1.7545787545787546) internal successors, (479), 405 states have internal predecessors, (479), 47 states have call successors, (47), 26 states have call predecessors, (47), 28 states have return successors, (93), 43 states have call predecessors, (93), 47 states have call successors, (93) [2022-11-25 22:24:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 619 transitions. [2022-11-25 22:24:31,764 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 619 transitions. Word has length 30 [2022-11-25 22:24:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:31,764 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 619 transitions. [2022-11-25 22:24:31,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 619 transitions. [2022-11-25 22:24:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 22:24:31,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:31,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:31,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 22:24:31,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1393656363, now seen corresponding path program 1 times [2022-11-25 22:24:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:31,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641348334] [2022-11-25 22:24:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:32,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:32,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641348334] [2022-11-25 22:24:32,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641348334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:32,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:32,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 22:24:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288949882] [2022-11-25 22:24:32,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:24:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:32,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:24:32,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:32,046 INFO L87 Difference]: Start difference. First operand 475 states and 619 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:24:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:32,730 INFO L93 Difference]: Finished difference Result 514 states and 682 transitions. [2022-11-25 22:24:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:24:32,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-11-25 22:24:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:32,733 INFO L225 Difference]: With dead ends: 514 [2022-11-25 22:24:32,733 INFO L226 Difference]: Without dead ends: 508 [2022-11-25 22:24:32,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:24:32,734 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 138 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:32,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1737 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-11-25 22:24:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 475. [2022-11-25 22:24:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 273 states have (on average 1.750915750915751) internal successors, (478), 405 states have internal predecessors, (478), 47 states have call successors, (47), 26 states have call predecessors, (47), 28 states have return successors, (94), 43 states have call predecessors, (94), 47 states have call successors, (94) [2022-11-25 22:24:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 619 transitions. [2022-11-25 22:24:32,751 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 619 transitions. Word has length 29 [2022-11-25 22:24:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:32,751 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 619 transitions. [2022-11-25 22:24:32,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:24:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 619 transitions. [2022-11-25 22:24:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 22:24:32,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:32,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:32,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 22:24:32,753 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:32,753 INFO L85 PathProgramCache]: Analyzing trace with hash -883195324, now seen corresponding path program 1 times [2022-11-25 22:24:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:32,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322227673] [2022-11-25 22:24:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:33,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:33,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322227673] [2022-11-25 22:24:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322227673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:33,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:33,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 22:24:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922622450] [2022-11-25 22:24:33,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:33,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:24:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:24:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:33,096 INFO L87 Difference]: Start difference. First operand 475 states and 619 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:34,187 INFO L93 Difference]: Finished difference Result 646 states and 910 transitions. [2022-11-25 22:24:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 22:24:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-11-25 22:24:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:34,191 INFO L225 Difference]: With dead ends: 646 [2022-11-25 22:24:34,191 INFO L226 Difference]: Without dead ends: 640 [2022-11-25 22:24:34,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-11-25 22:24:34,192 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 296 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:34,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1422 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 22:24:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-25 22:24:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2022-11-25 22:24:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 358 states have (on average 1.6592178770949721) internal successors, (594), 486 states have internal predecessors, (594), 57 states have call successors, (57), 33 states have call predecessors, (57), 45 states have return successors, (190), 67 states have call predecessors, (190), 57 states have call successors, (190) [2022-11-25 22:24:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 841 transitions. [2022-11-25 22:24:34,223 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 841 transitions. Word has length 32 [2022-11-25 22:24:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:34,223 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 841 transitions. [2022-11-25 22:24:34,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 841 transitions. [2022-11-25 22:24:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 22:24:34,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:34,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:34,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 22:24:34,225 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1758852491, now seen corresponding path program 1 times [2022-11-25 22:24:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997417311] [2022-11-25 22:24:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:34,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:34,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997417311] [2022-11-25 22:24:34,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997417311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:34,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:34,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:24:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840478431] [2022-11-25 22:24:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:34,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:24:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:34,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:24:34,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:24:34,565 INFO L87 Difference]: Start difference. First operand 587 states and 841 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:35,187 INFO L93 Difference]: Finished difference Result 608 states and 894 transitions. [2022-11-25 22:24:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:24:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-11-25 22:24:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:35,191 INFO L225 Difference]: With dead ends: 608 [2022-11-25 22:24:35,191 INFO L226 Difference]: Without dead ends: 608 [2022-11-25 22:24:35,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:35,192 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 665 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:35,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 256 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-25 22:24:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 568. [2022-11-25 22:24:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 467 states have internal predecessors, (561), 57 states have call successors, (57), 33 states have call predecessors, (57), 45 states have return successors, (190), 67 states have call predecessors, (190), 57 states have call successors, (190) [2022-11-25 22:24:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 808 transitions. [2022-11-25 22:24:35,232 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 808 transitions. Word has length 33 [2022-11-25 22:24:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:35,233 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 808 transitions. [2022-11-25 22:24:35,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 808 transitions. [2022-11-25 22:24:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 22:24:35,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:35,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:35,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 22:24:35,237 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:35,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1310147535, now seen corresponding path program 1 times [2022-11-25 22:24:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:35,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799552691] [2022-11-25 22:24:35,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:35,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:35,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799552691] [2022-11-25 22:24:35,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799552691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:35,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:35,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:24:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316120504] [2022-11-25 22:24:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:24:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:24:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:24:35,992 INFO L87 Difference]: Start difference. First operand 568 states and 808 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:37,214 INFO L93 Difference]: Finished difference Result 625 states and 934 transitions. [2022-11-25 22:24:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 22:24:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-25 22:24:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:37,219 INFO L225 Difference]: With dead ends: 625 [2022-11-25 22:24:37,219 INFO L226 Difference]: Without dead ends: 625 [2022-11-25 22:24:37,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-11-25 22:24:37,221 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 194 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:37,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1399 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 22:24:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-11-25 22:24:37,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 573. [2022-11-25 22:24:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 362 states have (on average 1.5635359116022098) internal successors, (566), 470 states have internal predecessors, (566), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-25 22:24:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 816 transitions. [2022-11-25 22:24:37,250 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 816 transitions. Word has length 34 [2022-11-25 22:24:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:37,251 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 816 transitions. [2022-11-25 22:24:37,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 816 transitions. [2022-11-25 22:24:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 22:24:37,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:37,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:37,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 22:24:37,252 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:37,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1310147534, now seen corresponding path program 1 times [2022-11-25 22:24:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:37,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294504659] [2022-11-25 22:24:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:38,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294504659] [2022-11-25 22:24:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294504659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 22:24:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880110943] [2022-11-25 22:24:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 22:24:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 22:24:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:24:38,550 INFO L87 Difference]: Start difference. First operand 573 states and 816 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:40,293 INFO L93 Difference]: Finished difference Result 624 states and 933 transitions. [2022-11-25 22:24:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:24:40,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-11-25 22:24:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:40,297 INFO L225 Difference]: With dead ends: 624 [2022-11-25 22:24:40,297 INFO L226 Difference]: Without dead ends: 624 [2022-11-25 22:24:40,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2022-11-25 22:24:40,298 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 465 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:40,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1252 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 22:24:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-25 22:24:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 573. [2022-11-25 22:24:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 470 states have internal predecessors, (565), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-25 22:24:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 815 transitions. [2022-11-25 22:24:40,333 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 815 transitions. Word has length 34 [2022-11-25 22:24:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:40,333 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 815 transitions. [2022-11-25 22:24:40,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:24:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 815 transitions. [2022-11-25 22:24:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:24:40,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:40,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:40,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 22:24:40,335 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -626359150, now seen corresponding path program 1 times [2022-11-25 22:24:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:40,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141567879] [2022-11-25 22:24:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:40,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:40,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141567879] [2022-11-25 22:24:40,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141567879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:40,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:40,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:24:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932341813] [2022-11-25 22:24:40,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:40,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:24:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:24:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:40,417 INFO L87 Difference]: Start difference. First operand 573 states and 815 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:40,629 INFO L93 Difference]: Finished difference Result 571 states and 811 transitions. [2022-11-25 22:24:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:24:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-25 22:24:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:40,633 INFO L225 Difference]: With dead ends: 571 [2022-11-25 22:24:40,633 INFO L226 Difference]: Without dead ends: 571 [2022-11-25 22:24:40,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:40,633 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:40,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 463 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:24:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-25 22:24:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2022-11-25 22:24:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 362 states have (on average 1.5497237569060773) internal successors, (561), 468 states have internal predecessors, (561), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-25 22:24:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 811 transitions. [2022-11-25 22:24:40,659 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 811 transitions. Word has length 36 [2022-11-25 22:24:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:40,659 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 811 transitions. [2022-11-25 22:24:40,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 811 transitions. [2022-11-25 22:24:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:24:40,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:40,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:40,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 22:24:40,672 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -626359149, now seen corresponding path program 1 times [2022-11-25 22:24:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:40,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857527542] [2022-11-25 22:24:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:40,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:40,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857527542] [2022-11-25 22:24:40,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857527542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:40,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:40,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:24:40,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163091577] [2022-11-25 22:24:40,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:40,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:24:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:24:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:40,793 INFO L87 Difference]: Start difference. First operand 571 states and 811 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:41,027 INFO L93 Difference]: Finished difference Result 569 states and 807 transitions. [2022-11-25 22:24:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:24:41,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-25 22:24:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:41,031 INFO L225 Difference]: With dead ends: 569 [2022-11-25 22:24:41,032 INFO L226 Difference]: Without dead ends: 569 [2022-11-25 22:24:41,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:24:41,032 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:41,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 467 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:24:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-25 22:24:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2022-11-25 22:24:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 362 states have (on average 1.5386740331491713) internal successors, (557), 466 states have internal predecessors, (557), 58 states have call successors, (58), 34 states have call predecessors, (58), 45 states have return successors, (192), 68 states have call predecessors, (192), 58 states have call successors, (192) [2022-11-25 22:24:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 807 transitions. [2022-11-25 22:24:41,055 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 807 transitions. Word has length 36 [2022-11-25 22:24:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:41,055 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 807 transitions. [2022-11-25 22:24:41,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 807 transitions. [2022-11-25 22:24:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 22:24:41,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:41,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:41,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 22:24:41,056 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:41,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -946818662, now seen corresponding path program 1 times [2022-11-25 22:24:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:41,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772896474] [2022-11-25 22:24:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:41,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:41,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:41,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772896474] [2022-11-25 22:24:41,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772896474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:41,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:41,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706181592] [2022-11-25 22:24:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:41,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:41,230 INFO L87 Difference]: Start difference. First operand 569 states and 807 transitions. Second operand has 7 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:41,832 INFO L93 Difference]: Finished difference Result 598 states and 856 transitions. [2022-11-25 22:24:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-25 22:24:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:41,836 INFO L225 Difference]: With dead ends: 598 [2022-11-25 22:24:41,836 INFO L226 Difference]: Without dead ends: 598 [2022-11-25 22:24:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:41,837 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 48 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:41,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1164 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-25 22:24:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 589. [2022-11-25 22:24:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 378 states have (on average 1.5343915343915344) internal successors, (580), 483 states have internal predecessors, (580), 59 states have call successors, (59), 36 states have call predecessors, (59), 48 states have return successors, (197), 69 states have call predecessors, (197), 59 states have call successors, (197) [2022-11-25 22:24:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2022-11-25 22:24:41,857 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 44 [2022-11-25 22:24:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:41,857 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2022-11-25 22:24:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2022-11-25 22:24:41,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 22:24:41,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:41,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 22:24:41,859 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash -946818661, now seen corresponding path program 1 times [2022-11-25 22:24:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528208556] [2022-11-25 22:24:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:42,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528208556] [2022-11-25 22:24:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528208556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:42,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:42,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:42,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156789979] [2022-11-25 22:24:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:42,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:42,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:42,198 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:42,810 INFO L93 Difference]: Finished difference Result 597 states and 855 transitions. [2022-11-25 22:24:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:24:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-25 22:24:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:42,814 INFO L225 Difference]: With dead ends: 597 [2022-11-25 22:24:42,814 INFO L226 Difference]: Without dead ends: 597 [2022-11-25 22:24:42,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:42,815 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 42 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:42,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1205 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-25 22:24:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2022-11-25 22:24:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 378 states have (on average 1.5317460317460319) internal successors, (579), 483 states have internal predecessors, (579), 59 states have call successors, (59), 36 states have call predecessors, (59), 48 states have return successors, (197), 69 states have call predecessors, (197), 59 states have call successors, (197) [2022-11-25 22:24:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 835 transitions. [2022-11-25 22:24:42,836 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 835 transitions. Word has length 44 [2022-11-25 22:24:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:42,836 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 835 transitions. [2022-11-25 22:24:42,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 835 transitions. [2022-11-25 22:24:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 22:24:42,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:42,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:42,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 22:24:42,838 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 702324391, now seen corresponding path program 1 times [2022-11-25 22:24:42,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:42,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710632877] [2022-11-25 22:24:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:43,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:43,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710632877] [2022-11-25 22:24:43,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710632877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:43,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:43,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890619969] [2022-11-25 22:24:43,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:43,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:43,005 INFO L87 Difference]: Start difference. First operand 589 states and 835 transitions. Second operand has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:43,653 INFO L93 Difference]: Finished difference Result 653 states and 925 transitions. [2022-11-25 22:24:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-25 22:24:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:43,658 INFO L225 Difference]: With dead ends: 653 [2022-11-25 22:24:43,658 INFO L226 Difference]: Without dead ends: 653 [2022-11-25 22:24:43,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:43,659 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 157 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:43,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1100 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-11-25 22:24:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2022-11-25 22:24:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 384 states have (on average 1.53125) internal successors, (588), 489 states have internal predecessors, (588), 60 states have call successors, (60), 37 states have call predecessors, (60), 49 states have return successors, (200), 70 states have call predecessors, (200), 60 states have call successors, (200) [2022-11-25 22:24:43,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2022-11-25 22:24:43,680 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 45 [2022-11-25 22:24:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:43,681 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2022-11-25 22:24:43,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2022-11-25 22:24:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 22:24:43,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:43,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:43,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 22:24:43,682 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash 702324392, now seen corresponding path program 1 times [2022-11-25 22:24:43,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:43,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259323625] [2022-11-25 22:24:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:43,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:43,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:43,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259323625] [2022-11-25 22:24:43,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259323625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:43,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:43,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:43,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171214677] [2022-11-25 22:24:43,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:43,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:43,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:43,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:43,993 INFO L87 Difference]: Start difference. First operand 597 states and 848 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:44,632 INFO L93 Difference]: Finished difference Result 604 states and 861 transitions. [2022-11-25 22:24:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:24:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-25 22:24:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:44,636 INFO L225 Difference]: With dead ends: 604 [2022-11-25 22:24:44,636 INFO L226 Difference]: Without dead ends: 604 [2022-11-25 22:24:44,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:44,637 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 39 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:44,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1182 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:44,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-25 22:24:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 597. [2022-11-25 22:24:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 384 states have (on average 1.5286458333333333) internal successors, (587), 489 states have internal predecessors, (587), 60 states have call successors, (60), 37 states have call predecessors, (60), 49 states have return successors, (200), 70 states have call predecessors, (200), 60 states have call successors, (200) [2022-11-25 22:24:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 847 transitions. [2022-11-25 22:24:44,657 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 847 transitions. Word has length 45 [2022-11-25 22:24:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:44,658 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 847 transitions. [2022-11-25 22:24:44,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 847 transitions. [2022-11-25 22:24:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 22:24:44,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:44,659 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:44,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 22:24:44,659 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 286662232, now seen corresponding path program 1 times [2022-11-25 22:24:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70150006] [2022-11-25 22:24:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:44,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:44,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70150006] [2022-11-25 22:24:44,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70150006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:44,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:44,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76689016] [2022-11-25 22:24:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:44,957 INFO L87 Difference]: Start difference. First operand 597 states and 847 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:45,629 INFO L93 Difference]: Finished difference Result 658 states and 956 transitions. [2022-11-25 22:24:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:45,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-25 22:24:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:45,634 INFO L225 Difference]: With dead ends: 658 [2022-11-25 22:24:45,634 INFO L226 Difference]: Without dead ends: 658 [2022-11-25 22:24:45,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:45,635 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 52 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:45,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1174 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-25 22:24:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 643. [2022-11-25 22:24:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 419 states have (on average 1.5178997613365155) internal successors, (636), 525 states have internal predecessors, (636), 65 states have call successors, (65), 41 states have call predecessors, (65), 55 states have return successors, (228), 76 states have call predecessors, (228), 65 states have call successors, (228) [2022-11-25 22:24:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 929 transitions. [2022-11-25 22:24:45,659 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 929 transitions. Word has length 46 [2022-11-25 22:24:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:45,660 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 929 transitions. [2022-11-25 22:24:45,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 929 transitions. [2022-11-25 22:24:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 22:24:45,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:45,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:45,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 22:24:45,661 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash 286662231, now seen corresponding path program 1 times [2022-11-25 22:24:45,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:45,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253734640] [2022-11-25 22:24:45,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:45,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:45,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253734640] [2022-11-25 22:24:45,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253734640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:45,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:45,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:45,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412839983] [2022-11-25 22:24:45,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:45,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:45,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:45,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:45,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:45,843 INFO L87 Difference]: Start difference. First operand 643 states and 929 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:46,464 INFO L93 Difference]: Finished difference Result 692 states and 1013 transitions. [2022-11-25 22:24:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-25 22:24:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:46,468 INFO L225 Difference]: With dead ends: 692 [2022-11-25 22:24:46,468 INFO L226 Difference]: Without dead ends: 692 [2022-11-25 22:24:46,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:46,469 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 110 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:46,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1111 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-25 22:24:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 654. [2022-11-25 22:24:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 426 states have (on average 1.5070422535211268) internal successors, (642), 534 states have internal predecessors, (642), 65 states have call successors, (65), 41 states have call predecessors, (65), 59 states have return successors, (236), 78 states have call predecessors, (236), 65 states have call successors, (236) [2022-11-25 22:24:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 943 transitions. [2022-11-25 22:24:46,492 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 943 transitions. Word has length 46 [2022-11-25 22:24:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:46,493 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 943 transitions. [2022-11-25 22:24:46,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 943 transitions. [2022-11-25 22:24:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 22:24:46,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:46,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:46,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 22:24:46,494 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:46,495 INFO L85 PathProgramCache]: Analyzing trace with hash 285818212, now seen corresponding path program 1 times [2022-11-25 22:24:46,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:46,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355038115] [2022-11-25 22:24:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:46,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:46,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355038115] [2022-11-25 22:24:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355038115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:46,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:46,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286253593] [2022-11-25 22:24:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:46,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:46,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:46,680 INFO L87 Difference]: Start difference. First operand 654 states and 943 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:47,287 INFO L93 Difference]: Finished difference Result 711 states and 1055 transitions. [2022-11-25 22:24:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-25 22:24:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:47,292 INFO L225 Difference]: With dead ends: 711 [2022-11-25 22:24:47,292 INFO L226 Difference]: Without dead ends: 711 [2022-11-25 22:24:47,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:47,293 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 82 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:47,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1116 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-25 22:24:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 669. [2022-11-25 22:24:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 438 states have (on average 1.5091324200913243) internal successors, (661), 547 states have internal predecessors, (661), 66 states have call successors, (66), 42 states have call predecessors, (66), 61 states have return successors, (241), 79 states have call predecessors, (241), 66 states have call successors, (241) [2022-11-25 22:24:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 968 transitions. [2022-11-25 22:24:47,318 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 968 transitions. Word has length 47 [2022-11-25 22:24:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:47,319 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 968 transitions. [2022-11-25 22:24:47,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 968 transitions. [2022-11-25 22:24:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 22:24:47,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:47,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:47,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 22:24:47,320 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 285818213, now seen corresponding path program 1 times [2022-11-25 22:24:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:47,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194617687] [2022-11-25 22:24:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:47,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:47,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194617687] [2022-11-25 22:24:47,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194617687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:47,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:47,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:24:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928073144] [2022-11-25 22:24:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:47,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:24:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:24:47,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:24:47,651 INFO L87 Difference]: Start difference. First operand 669 states and 968 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:48,298 INFO L93 Difference]: Finished difference Result 737 states and 1089 transitions. [2022-11-25 22:24:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:24:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-11-25 22:24:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:48,302 INFO L225 Difference]: With dead ends: 737 [2022-11-25 22:24:48,303 INFO L226 Difference]: Without dead ends: 737 [2022-11-25 22:24:48,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:24:48,303 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 65 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:48,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1174 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:24:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2022-11-25 22:24:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 718. [2022-11-25 22:24:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 476 states have (on average 1.495798319327731) internal successors, (712), 587 states have internal predecessors, (712), 70 states have call successors, (70), 45 states have call predecessors, (70), 68 states have return successors, (268), 85 states have call predecessors, (268), 70 states have call successors, (268) [2022-11-25 22:24:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1050 transitions. [2022-11-25 22:24:48,329 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1050 transitions. Word has length 47 [2022-11-25 22:24:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:48,330 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1050 transitions. [2022-11-25 22:24:48,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1050 transitions. [2022-11-25 22:24:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 22:24:48,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:48,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 22:24:48,331 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1565375413, now seen corresponding path program 1 times [2022-11-25 22:24:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031698220] [2022-11-25 22:24:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:48,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:48,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031698220] [2022-11-25 22:24:48,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031698220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:48,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:48,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 22:24:48,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347725822] [2022-11-25 22:24:48,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:48,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:24:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:48,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:24:48,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:24:48,773 INFO L87 Difference]: Start difference. First operand 718 states and 1050 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:49,899 INFO L93 Difference]: Finished difference Result 1073 states and 1769 transitions. [2022-11-25 22:24:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 22:24:49,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-11-25 22:24:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:49,907 INFO L225 Difference]: With dead ends: 1073 [2022-11-25 22:24:49,908 INFO L226 Difference]: Without dead ends: 1073 [2022-11-25 22:24:49,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-25 22:24:49,909 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 186 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:49,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 2085 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 22:24:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-11-25 22:24:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 953. [2022-11-25 22:24:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 651 states have (on average 1.4162826420890937) internal successors, (922), 758 states have internal predecessors, (922), 87 states have call successors, (87), 57 states have call predecessors, (87), 111 states have return successors, (501), 137 states have call predecessors, (501), 87 states have call successors, (501) [2022-11-25 22:24:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1510 transitions. [2022-11-25 22:24:49,961 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1510 transitions. Word has length 49 [2022-11-25 22:24:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:49,962 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1510 transitions. [2022-11-25 22:24:49,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:24:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1510 transitions. [2022-11-25 22:24:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:24:49,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:49,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:49,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 22:24:49,963 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1507151097, now seen corresponding path program 1 times [2022-11-25 22:24:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646982383] [2022-11-25 22:24:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:24:51,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646982383] [2022-11-25 22:24:51,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646982383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:24:51,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024148896] [2022-11-25 22:24:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:51,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:24:51,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:24:51,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:24:51,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:24:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:51,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 22:24:51,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:24:51,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 22:24:51,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-25 22:24:51,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:24:51,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:51,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-25 22:24:51,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:51,878 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:24:51,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2022-11-25 22:24:51,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2022-11-25 22:24:51,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-25 22:24:51,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:51,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-11-25 22:24:51,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:51,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2022-11-25 22:24:52,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:52,018 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:24:52,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:24:52,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-25 22:24:52,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:24:52,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:52,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 22:24:52,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 22:24:52,298 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array Int Int))) (= (store |c_old(#memory_int)| c_~user~0.base v_ArrVal_1973) |c_#memory_int|)) (exists ((v_ArrVal_1972 Int)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_~user~0.base (store (select |c_old(#memory_$Pointer$.base)| c_~user~0.base) c_~user~0.offset v_ArrVal_1972))))) is different from true [2022-11-25 22:24:52,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 22:24:52,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-25 22:24:52,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-11-25 22:24:52,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-25 22:24:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:24:52,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:24:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024148896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:52,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:24:52,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 27 [2022-11-25 22:24:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106014061] [2022-11-25 22:24:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:52,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 22:24:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 22:24:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=561, Unknown=1, NotChecked=48, Total=702 [2022-11-25 22:24:52,390 INFO L87 Difference]: Start difference. First operand 953 states and 1510 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:24:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:54,050 INFO L93 Difference]: Finished difference Result 982 states and 1566 transitions. [2022-11-25 22:24:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 22:24:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-25 22:24:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:54,056 INFO L225 Difference]: With dead ends: 982 [2022-11-25 22:24:54,057 INFO L226 Difference]: Without dead ends: 982 [2022-11-25 22:24:54,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=1115, Unknown=7, NotChecked=70, Total=1406 [2022-11-25 22:24:54,058 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 156 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:54,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 2215 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1403 Invalid, 0 Unknown, 408 Unchecked, 1.2s Time] [2022-11-25 22:24:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-11-25 22:24:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 970. [2022-11-25 22:24:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 664 states have (on average 1.408132530120482) internal successors, (935), 769 states have internal predecessors, (935), 87 states have call successors, (87), 57 states have call predecessors, (87), 115 states have return successors, (531), 143 states have call predecessors, (531), 87 states have call successors, (531) [2022-11-25 22:24:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1553 transitions. [2022-11-25 22:24:54,096 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1553 transitions. Word has length 51 [2022-11-25 22:24:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:54,096 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1553 transitions. [2022-11-25 22:24:54,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:24:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1553 transitions. [2022-11-25 22:24:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 22:24:54,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:54,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:54,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 22:24:54,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-25 22:24:54,305 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1588240793, now seen corresponding path program 1 times [2022-11-25 22:24:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:54,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104904170] [2022-11-25 22:24:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 22:24:54,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:54,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104904170] [2022-11-25 22:24:54,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104904170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:54,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:54,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:24:54,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715559923] [2022-11-25 22:24:54,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:54,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:24:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:24:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:24:54,707 INFO L87 Difference]: Start difference. First operand 970 states and 1553 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:24:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:55,218 INFO L93 Difference]: Finished difference Result 1050 states and 1739 transitions. [2022-11-25 22:24:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:24:55,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-11-25 22:24:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:55,225 INFO L225 Difference]: With dead ends: 1050 [2022-11-25 22:24:55,225 INFO L226 Difference]: Without dead ends: 1050 [2022-11-25 22:24:55,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:24:55,226 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 41 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:55,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1838 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:24:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2022-11-25 22:24:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1026. [2022-11-25 22:24:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 709 states have (on average 1.4047954866008463) internal successors, (996), 816 states have internal predecessors, (996), 92 states have call successors, (92), 63 states have call predecessors, (92), 121 states have return successors, (569), 146 states have call predecessors, (569), 92 states have call successors, (569) [2022-11-25 22:24:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1657 transitions. [2022-11-25 22:24:55,274 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1657 transitions. Word has length 51 [2022-11-25 22:24:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:55,274 INFO L495 AbstractCegarLoop]: Abstraction has 1026 states and 1657 transitions. [2022-11-25 22:24:55,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:24:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1657 transitions. [2022-11-25 22:24:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 22:24:55,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:55,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:55,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 22:24:55,276 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 396369414, now seen corresponding path program 1 times [2022-11-25 22:24:55,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:55,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889313828] [2022-11-25 22:24:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:24:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:24:55,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:24:55,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889313828] [2022-11-25 22:24:55,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889313828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:24:55,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:24:55,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:24:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88927571] [2022-11-25 22:24:55,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:24:55,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:24:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:24:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:24:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:24:55,426 INFO L87 Difference]: Start difference. First operand 1026 states and 1657 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:24:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:24:55,739 INFO L93 Difference]: Finished difference Result 1024 states and 1655 transitions. [2022-11-25 22:24:55,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:24:55,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-11-25 22:24:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:24:55,756 INFO L225 Difference]: With dead ends: 1024 [2022-11-25 22:24:55,761 INFO L226 Difference]: Without dead ends: 1024 [2022-11-25 22:24:55,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:24:55,762 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 33 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:24:55,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 619 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:24:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-25 22:24:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-25 22:24:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 709 states have (on average 1.4019746121297603) internal successors, (994), 814 states have internal predecessors, (994), 92 states have call successors, (92), 63 states have call predecessors, (92), 121 states have return successors, (569), 146 states have call predecessors, (569), 92 states have call successors, (569) [2022-11-25 22:24:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1655 transitions. [2022-11-25 22:24:55,798 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1655 transitions. Word has length 52 [2022-11-25 22:24:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:24:55,798 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1655 transitions. [2022-11-25 22:24:55,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:24:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1655 transitions. [2022-11-25 22:24:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 22:24:55,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:24:55,800 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:55,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 22:24:55,801 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 159 more)] === [2022-11-25 22:24:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:24:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 396369415, now seen corresponding path program 1 times [2022-11-25 22:24:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:24:55,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661776396] [2022-11-25 22:24:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:24:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:24:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:24:55,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 22:24:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:24:55,924 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 22:24:55,924 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 22:24:55,925 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 162 remaining) [2022-11-25 22:24:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 162 remaining) [2022-11-25 22:24:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 162 remaining) [2022-11-25 22:24:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 162 remaining) [2022-11-25 22:24:55,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 162 remaining) [2022-11-25 22:24:55,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 162 remaining) [2022-11-25 22:24:55,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 162 remaining) [2022-11-25 22:24:55,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 162 remaining) [2022-11-25 22:24:55,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 162 remaining) [2022-11-25 22:24:55,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 162 remaining) [2022-11-25 22:24:55,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 162 remaining) [2022-11-25 22:24:55,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 162 remaining) [2022-11-25 22:24:55,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 162 remaining) [2022-11-25 22:24:55,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 162 remaining) [2022-11-25 22:24:55,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 162 remaining) [2022-11-25 22:24:55,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 162 remaining) [2022-11-25 22:24:55,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 162 remaining) [2022-11-25 22:24:55,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 162 remaining) [2022-11-25 22:24:55,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 162 remaining) [2022-11-25 22:24:55,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 162 remaining) [2022-11-25 22:24:55,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 162 remaining) [2022-11-25 22:24:55,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 162 remaining) [2022-11-25 22:24:55,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 162 remaining) [2022-11-25 22:24:55,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 162 remaining) [2022-11-25 22:24:55,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 162 remaining) [2022-11-25 22:24:55,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 162 remaining) [2022-11-25 22:24:55,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 162 remaining) [2022-11-25 22:24:55,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 162 remaining) [2022-11-25 22:24:55,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 162 remaining) [2022-11-25 22:24:55,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 162 remaining) [2022-11-25 22:24:55,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 162 remaining) [2022-11-25 22:24:55,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 162 remaining) [2022-11-25 22:24:55,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 162 remaining) [2022-11-25 22:24:55,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 162 remaining) [2022-11-25 22:24:55,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 162 remaining) [2022-11-25 22:24:55,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 162 remaining) [2022-11-25 22:24:55,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 162 remaining) [2022-11-25 22:24:55,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 162 remaining) [2022-11-25 22:24:55,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 162 remaining) [2022-11-25 22:24:55,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 162 remaining) [2022-11-25 22:24:55,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 162 remaining) [2022-11-25 22:24:55,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 162 remaining) [2022-11-25 22:24:55,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 162 remaining) [2022-11-25 22:24:55,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 162 remaining) [2022-11-25 22:24:55,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 162 remaining) [2022-11-25 22:24:55,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 162 remaining) [2022-11-25 22:24:55,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 162 remaining) [2022-11-25 22:24:55,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 162 remaining) [2022-11-25 22:24:55,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 162 remaining) [2022-11-25 22:24:55,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 162 remaining) [2022-11-25 22:24:55,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 162 remaining) [2022-11-25 22:24:55,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 162 remaining) [2022-11-25 22:24:55,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 162 remaining) [2022-11-25 22:24:55,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 162 remaining) [2022-11-25 22:24:55,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 162 remaining) [2022-11-25 22:24:55,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 162 remaining) [2022-11-25 22:24:55,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 162 remaining) [2022-11-25 22:24:55,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 162 remaining) [2022-11-25 22:24:55,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 162 remaining) [2022-11-25 22:24:55,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 162 remaining) [2022-11-25 22:24:55,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 162 remaining) [2022-11-25 22:24:55,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 162 remaining) [2022-11-25 22:24:55,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 162 remaining) [2022-11-25 22:24:55,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 162 remaining) [2022-11-25 22:24:55,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 162 remaining) [2022-11-25 22:24:55,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 162 remaining) [2022-11-25 22:24:55,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 162 remaining) [2022-11-25 22:24:55,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 162 remaining) [2022-11-25 22:24:55,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 162 remaining) [2022-11-25 22:24:55,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 162 remaining) [2022-11-25 22:24:55,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 162 remaining) [2022-11-25 22:24:55,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 162 remaining) [2022-11-25 22:24:55,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 162 remaining) [2022-11-25 22:24:55,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 162 remaining) [2022-11-25 22:24:55,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 162 remaining) [2022-11-25 22:24:55,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 162 remaining) [2022-11-25 22:24:55,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 162 remaining) [2022-11-25 22:24:55,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 162 remaining) [2022-11-25 22:24:55,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 162 remaining) [2022-11-25 22:24:55,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 162 remaining) [2022-11-25 22:24:55,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 162 remaining) [2022-11-25 22:24:55,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 162 remaining) [2022-11-25 22:24:55,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 162 remaining) [2022-11-25 22:24:55,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 162 remaining) [2022-11-25 22:24:55,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 162 remaining) [2022-11-25 22:24:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 162 remaining) [2022-11-25 22:24:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 162 remaining) [2022-11-25 22:24:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 162 remaining) [2022-11-25 22:24:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 162 remaining) [2022-11-25 22:24:55,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 162 remaining) [2022-11-25 22:24:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 162 remaining) [2022-11-25 22:24:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 162 remaining) [2022-11-25 22:24:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 162 remaining) [2022-11-25 22:24:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 162 remaining) [2022-11-25 22:24:55,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 162 remaining) [2022-11-25 22:24:55,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 162 remaining) [2022-11-25 22:24:55,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 162 remaining) [2022-11-25 22:24:55,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 162 remaining) [2022-11-25 22:24:55,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 162 remaining) [2022-11-25 22:24:55,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 162 remaining) [2022-11-25 22:24:55,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 162 remaining) [2022-11-25 22:24:55,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 162 remaining) [2022-11-25 22:24:55,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 162 remaining) [2022-11-25 22:24:55,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 162 remaining) [2022-11-25 22:24:55,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 162 remaining) [2022-11-25 22:24:55,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 162 remaining) [2022-11-25 22:24:55,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 162 remaining) [2022-11-25 22:24:55,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 162 remaining) [2022-11-25 22:24:55,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 162 remaining) [2022-11-25 22:24:55,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 162 remaining) [2022-11-25 22:24:55,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 162 remaining) [2022-11-25 22:24:55,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 162 remaining) [2022-11-25 22:24:55,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 162 remaining) [2022-11-25 22:24:55,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 162 remaining) [2022-11-25 22:24:55,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 162 remaining) [2022-11-25 22:24:55,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 162 remaining) [2022-11-25 22:24:55,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 162 remaining) [2022-11-25 22:24:55,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 162 remaining) [2022-11-25 22:24:55,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 162 remaining) [2022-11-25 22:24:55,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 162 remaining) [2022-11-25 22:24:55,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 162 remaining) [2022-11-25 22:24:55,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 162 remaining) [2022-11-25 22:24:55,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 162 remaining) [2022-11-25 22:24:55,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 162 remaining) [2022-11-25 22:24:55,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 162 remaining) [2022-11-25 22:24:55,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 162 remaining) [2022-11-25 22:24:55,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 162 remaining) [2022-11-25 22:24:55,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 162 remaining) [2022-11-25 22:24:55,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 162 remaining) [2022-11-25 22:24:55,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 162 remaining) [2022-11-25 22:24:55,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 162 remaining) [2022-11-25 22:24:55,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 162 remaining) [2022-11-25 22:24:55,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 162 remaining) [2022-11-25 22:24:55,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 162 remaining) [2022-11-25 22:24:55,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 162 remaining) [2022-11-25 22:24:55,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 162 remaining) [2022-11-25 22:24:55,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 162 remaining) [2022-11-25 22:24:55,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 162 remaining) [2022-11-25 22:24:55,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 162 remaining) [2022-11-25 22:24:55,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 162 remaining) [2022-11-25 22:24:55,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 162 remaining) [2022-11-25 22:24:55,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 162 remaining) [2022-11-25 22:24:55,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 162 remaining) [2022-11-25 22:24:55,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 162 remaining) [2022-11-25 22:24:55,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 162 remaining) [2022-11-25 22:24:55,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 162 remaining) [2022-11-25 22:24:55,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 162 remaining) [2022-11-25 22:24:55,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 162 remaining) [2022-11-25 22:24:55,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 162 remaining) [2022-11-25 22:24:55,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 162 remaining) [2022-11-25 22:24:55,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 162 remaining) [2022-11-25 22:24:55,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 162 remaining) [2022-11-25 22:24:55,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 162 remaining) [2022-11-25 22:24:55,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 162 remaining) [2022-11-25 22:24:55,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 162 remaining) [2022-11-25 22:24:55,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 162 remaining) [2022-11-25 22:24:55,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 162 remaining) [2022-11-25 22:24:55,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 162 remaining) [2022-11-25 22:24:55,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 162 remaining) [2022-11-25 22:24:55,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 162 remaining) [2022-11-25 22:24:55,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 162 remaining) [2022-11-25 22:24:55,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 162 remaining) [2022-11-25 22:24:55,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 22:24:55,964 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:24:55,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:24:56,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:24:56 BoogieIcfgContainer [2022-11-25 22:24:56,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:24:56,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:24:56,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:24:56,023 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:24:56,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:24:13" (3/4) ... [2022-11-25 22:24:56,026 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 22:24:56,099 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 22:24:56,099 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:24:56,102 INFO L158 Benchmark]: Toolchain (without parser) took 45394.08ms. Allocated memory was 153.1MB in the beginning and 497.0MB in the end (delta: 343.9MB). Free memory was 113.6MB in the beginning and 355.0MB in the end (delta: -241.4MB). Peak memory consumption was 105.6MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,103 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:24:56,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.08ms. Allocated memory is still 153.1MB. Free memory was 113.1MB in the beginning and 87.3MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.16ms. Allocated memory is still 153.1MB. Free memory was 87.3MB in the beginning and 84.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,105 INFO L158 Benchmark]: Boogie Preprocessor took 49.30ms. Allocated memory is still 153.1MB. Free memory was 84.2MB in the beginning and 81.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,105 INFO L158 Benchmark]: RCFGBuilder took 1572.08ms. Allocated memory is still 153.1MB. Free memory was 81.1MB in the beginning and 75.7MB in the end (delta: 5.4MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,105 INFO L158 Benchmark]: TraceAbstraction took 42962.41ms. Allocated memory was 153.1MB in the beginning and 497.0MB in the end (delta: 343.9MB). Free memory was 74.8MB in the beginning and 359.2MB in the end (delta: -284.4MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,110 INFO L158 Benchmark]: Witness Printer took 76.62ms. Allocated memory is still 497.0MB. Free memory was 359.2MB in the beginning and 355.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 22:24:56,111 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.18ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.08ms. Allocated memory is still 153.1MB. Free memory was 113.1MB in the beginning and 87.3MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.16ms. Allocated memory is still 153.1MB. Free memory was 87.3MB in the beginning and 84.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.30ms. Allocated memory is still 153.1MB. Free memory was 84.2MB in the beginning and 81.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1572.08ms. Allocated memory is still 153.1MB. Free memory was 81.1MB in the beginning and 75.7MB in the end (delta: 5.4MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42962.41ms. Allocated memory was 153.1MB in the beginning and 497.0MB in the end (delta: 343.9MB). Free memory was 74.8MB in the beginning and 359.2MB in the end (delta: -284.4MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 76.62ms. Allocated memory is still 497.0MB. Free memory was 359.2MB in the beginning and 355.0MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L967] user->message.id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L968] EXPR user->info VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}, user->info={7:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L970] user->user_id = 11 VAL [calloc(1, sizeof(info_t))={7:0}, user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; VAL [\old(argc)=79, argc=79, argv={84:81}, argv={84:81}, e={10:0}, user={-1:0}] [L978] e.primitive = _EVENT_START VAL [\old(argc)=79, argc=79, argv={84:81}, argv={84:81}, e={10:0}, user={-1:0}] [L979] CALL event_precess(&e) VAL [e={10:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [e={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [e={10:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [e={10:0}, e={10:0}, primitive=0, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}, user->status=1] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, status=2, user={-1:0}] [L840] RET status_update(AS_START) VAL [e={10:0}, e={10:0}, primitive=0, status_update(AS_START)=10, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}, user->info={7:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}, user->info={7:0}, user->info->is_valid=0] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [e={9:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [e={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [e={9:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-1:16}, primitive=3, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) VAL [calloc(0, sizeof(*message))={-2:0}, e={9:0}, e={9:0}, message={-2:0}, primitive=3, rc=-1, user={-1:0}] [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 356 locations, 162 error locations. Started 1 CEGAR loops. OverallTime: 42.8s, OverallIterations: 40, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5476 SdHoareTripleChecker+Valid, 24.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5439 mSDsluCounter, 43838 SdHoareTripleChecker+Invalid, 20.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 408 IncrementalHoareTripleChecker+Unchecked, 32549 mSDsCounter, 1237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30958 IncrementalHoareTripleChecker+Invalid, 32603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1237 mSolverCounterUnsat, 11289 mSDtfsCounter, 30958 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 321 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=38, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 1100 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1188 ConstructedInterpolants, 2 QuantifiedInterpolants, 6334 SizeOfPredicates, 17 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 40 InterpolantComputations, 39 PerfectInterpolantSequences, 69/70 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-25 22:24:56,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44881ac8-d9df-448d-bc2d-4ea7541c76e8/bin/utaipan-ByfvJB40ur/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)