./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 --- 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 23:37:19,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:37:19,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:37:19,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:37:19,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:37:19,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:37:19,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:37:19,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:37:19,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:37:19,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:37:19,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:37:19,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:37:19,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:37:19,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:37:19,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:37:19,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:37:19,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:37:19,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:37:19,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:37:19,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:37:19,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:37:19,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:37:19,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:37:19,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:37:19,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:37:19,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:37:19,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:37:19,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:37:19,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:37:19,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:37:19,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:37:19,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:37:19,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:37:19,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:37:19,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:37:19,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:37:19,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:37:19,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:37:19,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:37:19,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:37:19,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:37:19,093 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:37:19,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:37:19,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:37:19,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:37:19,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:37:19,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:37:19,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:37:19,122 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:37:19,122 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:37:19,122 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:37:19,122 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:37:19,123 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:37:19,123 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:37:19,123 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:37:19,123 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:37:19,123 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:37:19,123 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:37:19,124 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:37:19,124 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:37:19,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:37:19,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:37:19,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:37:19,125 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:37:19,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:37:19,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:37:19,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:37:19,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:37:19,126 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:37:19,126 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:37:19,126 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:37:19,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:37:19,127 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:37:19,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:37:19,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:37:19,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:37:19,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:37:19,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:37:19,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:37:19,128 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:37:19,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:37:19,128 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:37:19,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:37:19,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:37:19,129 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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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 -> 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 [2022-11-25 23:37:19,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:37:19,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:37:19,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:37:19,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:37:19,510 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:37:19,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2022-11-25 23:37:22,628 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:37:22,974 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:37:22,975 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2022-11-25 23:37:22,995 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data/139fbb91f/c78fe7973c8349d289850bf9ff42130a/FLAG393e7788f [2022-11-25 23:37:23,011 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data/139fbb91f/c78fe7973c8349d289850bf9ff42130a [2022-11-25 23:37:23,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:37:23,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:37:23,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:37:23,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:37:23,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:37:23,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee24479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23, skipping insertion in model container [2022-11-25 23:37:23,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:37:23,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:37:23,393 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:37:23,674 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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i[55568,55581] [2022-11-25 23:37:23,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:37:23,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:37:23,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:37:23,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:37:23,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:37:23,716 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:37:23,730 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:37:23,751 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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i[55568,55581] [2022-11-25 23:37:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:37:23,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:37:23,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:37:23,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:37:23,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:37:23,874 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:37:23,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23 WrapperNode [2022-11-25 23:37:23,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:37:23,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:37:23,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:37:23,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:37:23,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,929 INFO L138 Inliner]: procedures = 325, calls = 53, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-11-25 23:37:23,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:37:23,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:37:23,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:37:23,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:37:23,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,977 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:23,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:37:24,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:37:24,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:37:24,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:37:24,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (1/1) ... [2022-11-25 23:37:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:37:24,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:24,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:37:24,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:37:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:37:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:37:24,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:37:24,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:37:24,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:37:24,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2022-11-25 23:37:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2022-11-25 23:37:24,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 23:37:24,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 23:37:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 23:37:24,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 23:37:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 23:37:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 23:37:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:37:24,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:37:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:37:24,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:37:24,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:37:24,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:37:24,078 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:37:24,277 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:37:24,279 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:37:24,645 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:37:24,652 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:37:24,656 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:37:24,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:37:24 BoogieIcfgContainer [2022-11-25 23:37:24,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:37:24,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:37:24,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:37:24,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:37:24,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:37:23" (1/3) ... [2022-11-25 23:37:24,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39944026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:37:24, skipping insertion in model container [2022-11-25 23:37:24,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:23" (2/3) ... [2022-11-25 23:37:24,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39944026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:37:24, skipping insertion in model container [2022-11-25 23:37:24,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:37:24" (3/3) ... [2022-11-25 23:37:24,672 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2022-11-25 23:37:24,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:37:24,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-25 23:37:24,689 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:37:24,896 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2022-11-25 23:37:24,936 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:37:24,953 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 257 transitions, 621 flow [2022-11-25 23:37:24,958 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 257 transitions, 621 flow [2022-11-25 23:37:24,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 257 transitions, 621 flow [2022-11-25 23:37:25,050 INFO L130 PetriNetUnfolder]: 7/178 cut-off events. [2022-11-25 23:37:25,051 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-25 23:37:25,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 178 events. 7/178 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 185 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2022-11-25 23:37:25,060 INFO L119 LiptonReduction]: Number of co-enabled transitions 2920 [2022-11-25 23:37:32,016 INFO L134 LiptonReduction]: Checked pairs total: 10036 [2022-11-25 23:37:32,017 INFO L136 LiptonReduction]: Total number of compositions: 187 [2022-11-25 23:37:32,028 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 143 transitions, 393 flow [2022-11-25 23:37:33,122 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15707 states, 14485 states have (on average 4.8327925440110455) internal successors, (70003), 15706 states have internal predecessors, (70003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:33,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:37:33,148 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;@47138a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:37:33,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2022-11-25 23:37:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 15707 states, 14485 states have (on average 4.8327925440110455) internal successors, (70003), 15706 states have internal predecessors, (70003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 23:37:33,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:33,189 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 23:37:33,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 706, now seen corresponding path program 1 times [2022-11-25 23:37:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:33,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583598370] [2022-11-25 23:37:33,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:33,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:33,442 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 23:37:33,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:33,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583598370] [2022-11-25 23:37:33,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583598370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:33,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:33,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 23:37:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235745772] [2022-11-25 23:37:33,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:33,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:37:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:37:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:37:33,503 INFO L87 Difference]: Start difference. First operand has 15707 states, 14485 states have (on average 4.8327925440110455) internal successors, (70003), 15706 states have internal predecessors, (70003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:33,997 INFO L93 Difference]: Finished difference Result 15703 states and 69999 transitions. [2022-11-25 23:37:33,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:37:34,000 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-25 23:37:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:34,350 INFO L225 Difference]: With dead ends: 15703 [2022-11-25 23:37:34,350 INFO L226 Difference]: Without dead ends: 15703 [2022-11-25 23:37:34,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:37:34,357 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:34,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15703 states. [2022-11-25 23:37:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15703 to 15703. [2022-11-25 23:37:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15703 states, 14485 states have (on average 4.8325163962720055) internal successors, (69999), 15702 states have internal predecessors, (69999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15703 states to 15703 states and 69999 transitions. [2022-11-25 23:37:35,608 INFO L78 Accepts]: Start accepts. Automaton has 15703 states and 69999 transitions. Word has length 1 [2022-11-25 23:37:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:35,609 INFO L495 AbstractCegarLoop]: Abstraction has 15703 states and 69999 transitions. [2022-11-25 23:37:35,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 15703 states and 69999 transitions. [2022-11-25 23:37:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:37:35,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:35,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:37:35,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:37:35,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash 692260, now seen corresponding path program 1 times [2022-11-25 23:37:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:35,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339732583] [2022-11-25 23:37:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:35,916 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 23:37:35,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:35,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339732583] [2022-11-25 23:37:35,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339732583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:35,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:35,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:37:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498116936] [2022-11-25 23:37:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:35,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:35,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:35,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:35,920 INFO L87 Difference]: Start difference. First operand 15703 states and 69999 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:36,460 INFO L93 Difference]: Finished difference Result 11793 states and 51538 transitions. [2022-11-25 23:37:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:36,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:37:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:36,714 INFO L225 Difference]: With dead ends: 11793 [2022-11-25 23:37:36,714 INFO L226 Difference]: Without dead ends: 11793 [2022-11-25 23:37:36,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:36,717 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:36,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 16 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:37:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2022-11-25 23:37:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11784. [2022-11-25 23:37:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11784 states, 10970 states have (on average 4.697265268915223) internal successors, (51529), 11783 states have internal predecessors, (51529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11784 states to 11784 states and 51529 transitions. [2022-11-25 23:37:37,643 INFO L78 Accepts]: Start accepts. Automaton has 11784 states and 51529 transitions. Word has length 3 [2022-11-25 23:37:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:37,644 INFO L495 AbstractCegarLoop]: Abstraction has 11784 states and 51529 transitions. [2022-11-25 23:37:37,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 11784 states and 51529 transitions. [2022-11-25 23:37:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:37:37,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:37,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:37:37,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:37:37,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 692261, now seen corresponding path program 1 times [2022-11-25 23:37:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:37,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608169958] [2022-11-25 23:37:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:37,758 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 23:37:37,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:37,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608169958] [2022-11-25 23:37:37,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608169958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:37,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:37,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:37:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466831470] [2022-11-25 23:37:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:37,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:37,762 INFO L87 Difference]: Start difference. First operand 11784 states and 51529 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:38,396 INFO L93 Difference]: Finished difference Result 15710 states and 66086 transitions. [2022-11-25 23:37:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:37:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:38,551 INFO L225 Difference]: With dead ends: 15710 [2022-11-25 23:37:38,551 INFO L226 Difference]: Without dead ends: 15710 [2022-11-25 23:37:38,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:38,553 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:38,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 62 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:37:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15710 states. [2022-11-25 23:37:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15710 to 11783. [2022-11-25 23:37:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11783 states, 10969 states have (on average 4.69751116783663) internal successors, (51527), 11782 states have internal predecessors, (51527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 51527 transitions. [2022-11-25 23:37:39,346 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 51527 transitions. Word has length 3 [2022-11-25 23:37:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:39,346 INFO L495 AbstractCegarLoop]: Abstraction has 11783 states and 51527 transitions. [2022-11-25 23:37:39,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 51527 transitions. [2022-11-25 23:37:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:37:39,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:39,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:37:39,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:37:39,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash 21458262, now seen corresponding path program 1 times [2022-11-25 23:37:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:39,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571627656] [2022-11-25 23:37:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:39,607 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 23:37:39,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:39,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571627656] [2022-11-25 23:37:39,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571627656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:39,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:39,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:37:39,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61195641] [2022-11-25 23:37:39,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:39,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:39,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:39,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:39,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:39,610 INFO L87 Difference]: Start difference. First operand 11783 states and 51527 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:39,925 INFO L93 Difference]: Finished difference Result 11771 states and 51500 transitions. [2022-11-25 23:37:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:37:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:39,998 INFO L225 Difference]: With dead ends: 11771 [2022-11-25 23:37:39,998 INFO L226 Difference]: Without dead ends: 11771 [2022-11-25 23:37:39,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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 23:37:40,003 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:40,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2022-11-25 23:37:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11771. [2022-11-25 23:37:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11771 states, 10959 states have (on average 4.699333880828543) internal successors, (51500), 11770 states have internal predecessors, (51500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 51500 transitions. [2022-11-25 23:37:40,622 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 51500 transitions. Word has length 4 [2022-11-25 23:37:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:40,623 INFO L495 AbstractCegarLoop]: Abstraction has 11771 states and 51500 transitions. [2022-11-25 23:37:40,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 51500 transitions. [2022-11-25 23:37:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:37:40,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:40,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:40,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:37:40,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -695169518, now seen corresponding path program 1 times [2022-11-25 23:37:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:40,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787569021] [2022-11-25 23:37:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:40,919 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 23:37:40,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:40,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787569021] [2022-11-25 23:37:40,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787569021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:40,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:40,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783657207] [2022-11-25 23:37:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:40,922 INFO L87 Difference]: Start difference. First operand 11771 states and 51500 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:41,359 INFO L93 Difference]: Finished difference Result 11764 states and 51487 transitions. [2022-11-25 23:37:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:41,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:37:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:41,465 INFO L225 Difference]: With dead ends: 11764 [2022-11-25 23:37:41,466 INFO L226 Difference]: Without dead ends: 11764 [2022-11-25 23:37:41,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 23:37:41,468 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:41,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 16 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11764 states. [2022-11-25 23:37:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11764 to 11764. [2022-11-25 23:37:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11764 states, 10955 states have (on average 4.699863076220904) internal successors, (51487), 11763 states have internal predecessors, (51487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11764 states to 11764 states and 51487 transitions. [2022-11-25 23:37:42,104 INFO L78 Accepts]: Start accepts. Automaton has 11764 states and 51487 transitions. Word has length 7 [2022-11-25 23:37:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:42,105 INFO L495 AbstractCegarLoop]: Abstraction has 11764 states and 51487 transitions. [2022-11-25 23:37:42,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11764 states and 51487 transitions. [2022-11-25 23:37:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:37:42,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:42,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:42,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:37:42,107 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash -695169517, now seen corresponding path program 1 times [2022-11-25 23:37:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474635138] [2022-11-25 23:37:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:42,375 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 23:37:42,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:42,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474635138] [2022-11-25 23:37:42,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474635138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:42,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:42,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:37:42,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277918310] [2022-11-25 23:37:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:42,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:37:42,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:37:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:37:42,378 INFO L87 Difference]: Start difference. First operand 11764 states and 51487 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:42,591 INFO L93 Difference]: Finished difference Result 11757 states and 51474 transitions. [2022-11-25 23:37:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:37:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:42,655 INFO L225 Difference]: With dead ends: 11757 [2022-11-25 23:37:42,655 INFO L226 Difference]: Without dead ends: 11757 [2022-11-25 23:37:42,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 23:37:42,656 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:42,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 9 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11757 states. [2022-11-25 23:37:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11757 to 11757. [2022-11-25 23:37:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 10951 states have (on average 4.70039265820473) internal successors, (51474), 11756 states have internal predecessors, (51474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 51474 transitions. [2022-11-25 23:37:43,249 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 51474 transitions. Word has length 7 [2022-11-25 23:37:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:43,249 INFO L495 AbstractCegarLoop]: Abstraction has 11757 states and 51474 transitions. [2022-11-25 23:37:43,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 51474 transitions. [2022-11-25 23:37:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:37:43,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:43,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:37:43,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -589268321, now seen corresponding path program 1 times [2022-11-25 23:37:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:43,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106632026] [2022-11-25 23:37:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:44,017 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 23:37:44,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:44,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106632026] [2022-11-25 23:37:44,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106632026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:44,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:44,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:37:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194937257] [2022-11-25 23:37:44,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:44,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:37:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:37:44,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:37:44,019 INFO L87 Difference]: Start difference. First operand 11757 states and 51474 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:44,289 INFO L93 Difference]: Finished difference Result 7855 states and 33034 transitions. [2022-11-25 23:37:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:37:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 23:37:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:44,340 INFO L225 Difference]: With dead ends: 7855 [2022-11-25 23:37:44,340 INFO L226 Difference]: Without dead ends: 7855 [2022-11-25 23:37:44,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:37:44,341 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:44,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 9 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:37:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2022-11-25 23:37:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 7847. [2022-11-25 23:37:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7847 states, 7442 states have (on average 4.437785541521096) internal successors, (33026), 7846 states have internal predecessors, (33026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7847 states to 7847 states and 33026 transitions. [2022-11-25 23:37:44,686 INFO L78 Accepts]: Start accepts. Automaton has 7847 states and 33026 transitions. Word has length 11 [2022-11-25 23:37:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:44,687 INFO L495 AbstractCegarLoop]: Abstraction has 7847 states and 33026 transitions. [2022-11-25 23:37:44,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7847 states and 33026 transitions. [2022-11-25 23:37:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:37:44,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:44,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:44,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:37:44,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1361216021, now seen corresponding path program 1 times [2022-11-25 23:37:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:44,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253753510] [2022-11-25 23:37:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:44,982 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 23:37:44,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:44,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253753510] [2022-11-25 23:37:44,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253753510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:44,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:44,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377355472] [2022-11-25 23:37:44,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:44,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:44,985 INFO L87 Difference]: Start difference. First operand 7847 states and 33026 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:45,137 INFO L93 Difference]: Finished difference Result 6595 states and 27148 transitions. [2022-11-25 23:37:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:45,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:37:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:45,176 INFO L225 Difference]: With dead ends: 6595 [2022-11-25 23:37:45,176 INFO L226 Difference]: Without dead ends: 6595 [2022-11-25 23:37:45,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 23:37:45,177 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:45,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 17 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6595 states. [2022-11-25 23:37:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6595 to 6595. [2022-11-25 23:37:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6272 states have (on average 4.32844387755102) internal successors, (27148), 6594 states have internal predecessors, (27148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 27148 transitions. [2022-11-25 23:37:45,646 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 27148 transitions. Word has length 14 [2022-11-25 23:37:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:45,647 INFO L495 AbstractCegarLoop]: Abstraction has 6595 states and 27148 transitions. [2022-11-25 23:37:45,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 27148 transitions. [2022-11-25 23:37:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:37:45,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:45,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:45,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:37:45,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1361216020, now seen corresponding path program 1 times [2022-11-25 23:37:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299338467] [2022-11-25 23:37:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:45,973 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 23:37:45,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:45,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299338467] [2022-11-25 23:37:45,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299338467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:45,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:45,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:37:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807761143] [2022-11-25 23:37:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:45,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:37:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:37:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:37:45,976 INFO L87 Difference]: Start difference. First operand 6595 states and 27148 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:46,120 INFO L93 Difference]: Finished difference Result 5343 states and 21270 transitions. [2022-11-25 23:37:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:46,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:37:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:46,145 INFO L225 Difference]: With dead ends: 5343 [2022-11-25 23:37:46,146 INFO L226 Difference]: Without dead ends: 5343 [2022-11-25 23:37:46,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:37:46,148 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:46,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 10 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2022-11-25 23:37:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 5343. [2022-11-25 23:37:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5102 states have (on average 4.168953351626813) internal successors, (21270), 5342 states have internal predecessors, (21270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 21270 transitions. [2022-11-25 23:37:46,371 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 21270 transitions. Word has length 14 [2022-11-25 23:37:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:46,371 INFO L495 AbstractCegarLoop]: Abstraction has 5343 states and 21270 transitions. [2022-11-25 23:37:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 21270 transitions. [2022-11-25 23:37:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:37:46,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:46,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:37:46,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1836443088, now seen corresponding path program 1 times [2022-11-25 23:37:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962348619] [2022-11-25 23:37:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:46,601 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 23:37:46,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:46,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962348619] [2022-11-25 23:37:46,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962348619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:46,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:46,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:37:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035330697] [2022-11-25 23:37:46,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:46,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:37:46,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:37:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:37:46,604 INFO L87 Difference]: Start difference. First operand 5343 states and 21270 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:46,748 INFO L93 Difference]: Finished difference Result 4823 states and 19274 transitions. [2022-11-25 23:37:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:37:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:46,771 INFO L225 Difference]: With dead ends: 4823 [2022-11-25 23:37:46,771 INFO L226 Difference]: Without dead ends: 4823 [2022-11-25 23:37:46,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:37:46,772 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:46,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 11 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2022-11-25 23:37:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4823. [2022-11-25 23:37:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 4642 states have (on average 4.152089616544592) internal successors, (19274), 4822 states have internal predecessors, (19274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 19274 transitions. [2022-11-25 23:37:46,908 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 19274 transitions. Word has length 16 [2022-11-25 23:37:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:46,909 INFO L495 AbstractCegarLoop]: Abstraction has 4823 states and 19274 transitions. [2022-11-25 23:37:46,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 19274 transitions. [2022-11-25 23:37:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:37:46,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:46,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:46,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:37:46,912 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1095155143, now seen corresponding path program 1 times [2022-11-25 23:37:46,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:46,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709633063] [2022-11-25 23:37:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:47,009 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 23:37:47,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:47,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709633063] [2022-11-25 23:37:47,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709633063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:47,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:47,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170160069] [2022-11-25 23:37:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:47,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:47,012 INFO L87 Difference]: Start difference. First operand 4823 states and 19274 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:47,231 INFO L93 Difference]: Finished difference Result 2316 states and 8696 transitions. [2022-11-25 23:37:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:37:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:47,241 INFO L225 Difference]: With dead ends: 2316 [2022-11-25 23:37:47,241 INFO L226 Difference]: Without dead ends: 2316 [2022-11-25 23:37:47,242 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 23:37:47,242 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:47,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 15 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-11-25 23:37:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2316. [2022-11-25 23:37:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2261 states have (on average 3.8460858027421496) internal successors, (8696), 2315 states have internal predecessors, (8696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 8696 transitions. [2022-11-25 23:37:47,305 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 8696 transitions. Word has length 17 [2022-11-25 23:37:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:47,306 INFO L495 AbstractCegarLoop]: Abstraction has 2316 states and 8696 transitions. [2022-11-25 23:37:47,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 8696 transitions. [2022-11-25 23:37:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:37:47,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:47,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:47,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:37:47,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1095155142, now seen corresponding path program 1 times [2022-11-25 23:37:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:47,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827758691] [2022-11-25 23:37:47,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:47,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:47,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827758691] [2022-11-25 23:37:47,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827758691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:47,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:47,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538740449] [2022-11-25 23:37:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:47,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:47,369 INFO L87 Difference]: Start difference. First operand 2316 states and 8696 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:47,458 INFO L93 Difference]: Finished difference Result 958 states and 3221 transitions. [2022-11-25 23:37:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:47,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:37:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:47,462 INFO L225 Difference]: With dead ends: 958 [2022-11-25 23:37:47,462 INFO L226 Difference]: Without dead ends: 958 [2022-11-25 23:37:47,462 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 23:37:47,463 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:47,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-11-25 23:37:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2022-11-25 23:37:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 946 states have (on average 3.404862579281184) internal successors, (3221), 957 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 3221 transitions. [2022-11-25 23:37:47,487 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 3221 transitions. Word has length 17 [2022-11-25 23:37:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:47,487 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 3221 transitions. [2022-11-25 23:37:47,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 3221 transitions. [2022-11-25 23:37:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:37:47,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:47,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:37:47,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash -409734131, now seen corresponding path program 1 times [2022-11-25 23:37:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121890417] [2022-11-25 23:37:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:47,635 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 23:37:47,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121890417] [2022-11-25 23:37:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121890417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:47,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:47,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:37:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696252309] [2022-11-25 23:37:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:37:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:47,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:37:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:37:47,638 INFO L87 Difference]: Start difference. First operand 958 states and 3221 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:47,716 INFO L93 Difference]: Finished difference Result 922 states and 3119 transitions. [2022-11-25 23:37:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:37:47,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:37:47,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:47,720 INFO L225 Difference]: With dead ends: 922 [2022-11-25 23:37:47,720 INFO L226 Difference]: Without dead ends: 922 [2022-11-25 23:37:47,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 23:37:47,721 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:47,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 13 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-11-25 23:37:47,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2022-11-25 23:37:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 912 states have (on average 3.419956140350877) internal successors, (3119), 921 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3119 transitions. [2022-11-25 23:37:47,744 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 3119 transitions. Word has length 18 [2022-11-25 23:37:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:47,746 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 3119 transitions. [2022-11-25 23:37:47,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 3119 transitions. [2022-11-25 23:37:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:37:47,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:47,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:47,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:37:47,750 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -409734130, now seen corresponding path program 1 times [2022-11-25 23:37:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:47,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624593430] [2022-11-25 23:37:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:47,959 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 23:37:47,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:47,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624593430] [2022-11-25 23:37:47,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624593430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:47,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:47,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:37:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199215593] [2022-11-25 23:37:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:37:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:47,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:37:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:37:47,962 INFO L87 Difference]: Start difference. First operand 922 states and 3119 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:48,056 INFO L93 Difference]: Finished difference Result 886 states and 3017 transitions. [2022-11-25 23:37:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:37:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:48,059 INFO L225 Difference]: With dead ends: 886 [2022-11-25 23:37:48,059 INFO L226 Difference]: Without dead ends: 886 [2022-11-25 23:37:48,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:37:48,059 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:48,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 12 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-25 23:37:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2022-11-25 23:37:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 878 states have (on average 3.43621867881549) internal successors, (3017), 885 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3017 transitions. [2022-11-25 23:37:48,076 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3017 transitions. Word has length 18 [2022-11-25 23:37:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:48,076 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 3017 transitions. [2022-11-25 23:37:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3017 transitions. [2022-11-25 23:37:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:37:48,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:48,077 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 23:37:48,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:37:48,077 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:48,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1382505450, now seen corresponding path program 1 times [2022-11-25 23:37:48,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:48,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903431163] [2022-11-25 23:37:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:48,232 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 23:37:48,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:48,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903431163] [2022-11-25 23:37:48,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903431163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:48,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:48,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:37:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791143324] [2022-11-25 23:37:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:48,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:37:48,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:37:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:37:48,234 INFO L87 Difference]: Start difference. First operand 886 states and 3017 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:48,328 INFO L93 Difference]: Finished difference Result 766 states and 2613 transitions. [2022-11-25 23:37:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:37:48,328 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:37:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:48,330 INFO L225 Difference]: With dead ends: 766 [2022-11-25 23:37:48,330 INFO L226 Difference]: Without dead ends: 766 [2022-11-25 23:37:48,333 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 23:37:48,333 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:48,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-25 23:37:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2022-11-25 23:37:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 762 states have (on average 3.4291338582677167) internal successors, (2613), 765 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2613 transitions. [2022-11-25 23:37:48,351 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2613 transitions. Word has length 20 [2022-11-25 23:37:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:48,352 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 2613 transitions. [2022-11-25 23:37:48,352 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2613 transitions. [2022-11-25 23:37:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 23:37:48,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:48,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:48,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:37:48,358 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -975492198, now seen corresponding path program 1 times [2022-11-25 23:37:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:48,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966200458] [2022-11-25 23:37:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:49,492 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 23:37:49,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:49,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966200458] [2022-11-25 23:37:49,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966200458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:49,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:49,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:37:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661636486] [2022-11-25 23:37:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:49,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:37:49,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:37:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:37:49,498 INFO L87 Difference]: Start difference. First operand 766 states and 2613 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:49,709 INFO L93 Difference]: Finished difference Result 771 states and 2617 transitions. [2022-11-25 23:37:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:37:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 23:37:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:49,712 INFO L225 Difference]: With dead ends: 771 [2022-11-25 23:37:49,712 INFO L226 Difference]: Without dead ends: 771 [2022-11-25 23:37:49,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:37:49,713 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:49,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 9 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-11-25 23:37:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 765. [2022-11-25 23:37:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 761 states have (on average 3.431011826544021) internal successors, (2611), 764 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2611 transitions. [2022-11-25 23:37:49,735 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2611 transitions. Word has length 44 [2022-11-25 23:37:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:49,735 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 2611 transitions. [2022-11-25 23:37:49,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2611 transitions. [2022-11-25 23:37:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:37:49,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:49,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:49,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:37:49,741 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash -175489764, now seen corresponding path program 1 times [2022-11-25 23:37:49,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:49,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221514443] [2022-11-25 23:37:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:50,504 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 23:37:50,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:50,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221514443] [2022-11-25 23:37:50,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221514443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:50,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:50,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:37:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568348449] [2022-11-25 23:37:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:37:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:37:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:37:50,506 INFO L87 Difference]: Start difference. First operand 765 states and 2611 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:50,695 INFO L93 Difference]: Finished difference Result 769 states and 2614 transitions. [2022-11-25 23:37:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:37:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 23:37:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:50,698 INFO L225 Difference]: With dead ends: 769 [2022-11-25 23:37:50,698 INFO L226 Difference]: Without dead ends: 769 [2022-11-25 23:37:50,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:37:50,699 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:50,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 9 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-11-25 23:37:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 764. [2022-11-25 23:37:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 760 states have (on average 3.432894736842105) internal successors, (2609), 763 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2609 transitions. [2022-11-25 23:37:50,720 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2609 transitions. Word has length 45 [2022-11-25 23:37:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:50,721 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 2609 transitions. [2022-11-25 23:37:50,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2609 transitions. [2022-11-25 23:37:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:37:50,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:50,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:50,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:37:50,725 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1145217280, now seen corresponding path program 1 times [2022-11-25 23:37:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:50,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056990124] [2022-11-25 23:37:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:50,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:51,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:51,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056990124] [2022-11-25 23:37:51,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056990124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:51,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:51,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:37:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882032817] [2022-11-25 23:37:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:51,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:37:51,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:37:51,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:37:51,515 INFO L87 Difference]: Start difference. First operand 764 states and 2609 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:51,734 INFO L93 Difference]: Finished difference Result 767 states and 2611 transitions. [2022-11-25 23:37:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:37:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-25 23:37:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:51,737 INFO L225 Difference]: With dead ends: 767 [2022-11-25 23:37:51,737 INFO L226 Difference]: Without dead ends: 767 [2022-11-25 23:37:51,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:37:51,738 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:51,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 9 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-11-25 23:37:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 763. [2022-11-25 23:37:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 759 states have (on average 3.4347826086956523) internal successors, (2607), 762 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 2607 transitions. [2022-11-25 23:37:51,761 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 2607 transitions. Word has length 46 [2022-11-25 23:37:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:51,762 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 2607 transitions. [2022-11-25 23:37:51,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 2607 transitions. [2022-11-25 23:37:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 23:37:51,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:51,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:37:51,766 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1141996786, now seen corresponding path program 1 times [2022-11-25 23:37:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:51,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975457090] [2022-11-25 23:37:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:52,497 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 23:37:52,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:52,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975457090] [2022-11-25 23:37:52,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975457090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:52,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:52,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:37:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144303100] [2022-11-25 23:37:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:37:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:37:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:37:52,500 INFO L87 Difference]: Start difference. First operand 763 states and 2607 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:52,731 INFO L93 Difference]: Finished difference Result 762 states and 2606 transitions. [2022-11-25 23:37:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:37:52,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-25 23:37:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:52,734 INFO L225 Difference]: With dead ends: 762 [2022-11-25 23:37:52,735 INFO L226 Difference]: Without dead ends: 762 [2022-11-25 23:37:52,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:37:52,735 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:52,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 9 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:37:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-11-25 23:37:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2022-11-25 23:37:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 759 states have (on average 3.4334650856389985) internal successors, (2606), 761 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 2606 transitions. [2022-11-25 23:37:52,758 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 2606 transitions. Word has length 47 [2022-11-25 23:37:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:52,758 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 2606 transitions. [2022-11-25 23:37:52,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:37:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 2606 transitions. [2022-11-25 23:37:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 23:37:52,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:52,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:52,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:37:52,762 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:37:52,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1660440486, now seen corresponding path program 1 times [2022-11-25 23:37:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:52,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163907708] [2022-11-25 23:37:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:37:52,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:37:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:37:52,966 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 23:37:52,966 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:37:52,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (72 of 73 remaining) [2022-11-25 23:37:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 73 remaining) [2022-11-25 23:37:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 73 remaining) [2022-11-25 23:37:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 73 remaining) [2022-11-25 23:37:52,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 73 remaining) [2022-11-25 23:37:52,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 73 remaining) [2022-11-25 23:37:52,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 73 remaining) [2022-11-25 23:37:52,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 73 remaining) [2022-11-25 23:37:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 73 remaining) [2022-11-25 23:37:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 73 remaining) [2022-11-25 23:37:52,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 73 remaining) [2022-11-25 23:37:52,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 73 remaining) [2022-11-25 23:37:52,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 73 remaining) [2022-11-25 23:37:52,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 73 remaining) [2022-11-25 23:37:52,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 73 remaining) [2022-11-25 23:37:52,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 73 remaining) [2022-11-25 23:37:52,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 73 remaining) [2022-11-25 23:37:52,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 73 remaining) [2022-11-25 23:37:52,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 73 remaining) [2022-11-25 23:37:52,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 73 remaining) [2022-11-25 23:37:52,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 73 remaining) [2022-11-25 23:37:52,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 73 remaining) [2022-11-25 23:37:52,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 73 remaining) [2022-11-25 23:37:52,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 73 remaining) [2022-11-25 23:37:52,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 73 remaining) [2022-11-25 23:37:52,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 73 remaining) [2022-11-25 23:37:52,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 73 remaining) [2022-11-25 23:37:52,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 73 remaining) [2022-11-25 23:37:52,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 73 remaining) [2022-11-25 23:37:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 73 remaining) [2022-11-25 23:37:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 73 remaining) [2022-11-25 23:37:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 73 remaining) [2022-11-25 23:37:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 73 remaining) [2022-11-25 23:37:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 73 remaining) [2022-11-25 23:37:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 73 remaining) [2022-11-25 23:37:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 73 remaining) [2022-11-25 23:37:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 73 remaining) [2022-11-25 23:37:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 73 remaining) [2022-11-25 23:37:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (34 of 73 remaining) [2022-11-25 23:37:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 73 remaining) [2022-11-25 23:37:52,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 73 remaining) [2022-11-25 23:37:52,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 73 remaining) [2022-11-25 23:37:52,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 73 remaining) [2022-11-25 23:37:52,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 73 remaining) [2022-11-25 23:37:52,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 73 remaining) [2022-11-25 23:37:52,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 73 remaining) [2022-11-25 23:37:52,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 73 remaining) [2022-11-25 23:37:52,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 73 remaining) [2022-11-25 23:37:52,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 73 remaining) [2022-11-25 23:37:52,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 73 remaining) [2022-11-25 23:37:52,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 73 remaining) [2022-11-25 23:37:52,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 73 remaining) [2022-11-25 23:37:52,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 73 remaining) [2022-11-25 23:37:52,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 73 remaining) [2022-11-25 23:37:52,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 73 remaining) [2022-11-25 23:37:52,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 73 remaining) [2022-11-25 23:37:52,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 73 remaining) [2022-11-25 23:37:52,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 73 remaining) [2022-11-25 23:37:52,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 73 remaining) [2022-11-25 23:37:52,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 73 remaining) [2022-11-25 23:37:52,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 73 remaining) [2022-11-25 23:37:52,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 73 remaining) [2022-11-25 23:37:52,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 73 remaining) [2022-11-25 23:37:52,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 73 remaining) [2022-11-25 23:37:52,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork4Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 73 remaining) [2022-11-25 23:37:52,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 73 remaining) [2022-11-25 23:37:52,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 73 remaining) [2022-11-25 23:37:52,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 73 remaining) [2022-11-25 23:37:52,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 73 remaining) [2022-11-25 23:37:52,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 73 remaining) [2022-11-25 23:37:52,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 73 remaining) [2022-11-25 23:37:52,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 73 remaining) [2022-11-25 23:37:52,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 73 remaining) [2022-11-25 23:37:52,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:37:52,993 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] [2022-11-25 23:37:53,001 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 23:37:53,002 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:37:53,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:37:53 BasicIcfg [2022-11-25 23:37:53,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:37:53,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:37:53,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:37:53,128 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:37:53,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:37:24" (3/4) ... [2022-11-25 23:37:53,138 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:37:53,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:37:53,139 INFO L158 Benchmark]: Toolchain (without parser) took 30119.44ms. Allocated memory was 174.1MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 136.7MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 985.4MB. Max. memory is 16.1GB. [2022-11-25 23:37:53,139 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 127.9MB. Free memory was 95.0MB in the beginning and 94.9MB in the end (delta: 74.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:37:53,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 852.16ms. Allocated memory is still 174.1MB. Free memory was 136.7MB in the beginning and 116.2MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 23:37:53,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.80ms. Allocated memory is still 174.1MB. Free memory was 116.2MB in the beginning and 113.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:53,140 INFO L158 Benchmark]: Boogie Preprocessor took 68.39ms. Allocated memory is still 174.1MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:37:53,141 INFO L158 Benchmark]: RCFGBuilder took 660.66ms. Allocated memory is still 174.1MB. Free memory was 111.9MB in the beginning and 91.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:37:53,141 INFO L158 Benchmark]: TraceAbstraction took 28464.23ms. Allocated memory was 174.1MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 90.3MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 941.8MB. Max. memory is 16.1GB. [2022-11-25 23:37:53,142 INFO L158 Benchmark]: Witness Printer took 10.47ms. Allocated memory is still 8.7GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:37:53,146 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.28ms. Allocated memory is still 127.9MB. Free memory was 95.0MB in the beginning and 94.9MB in the end (delta: 74.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 852.16ms. Allocated memory is still 174.1MB. Free memory was 136.7MB in the beginning and 116.2MB in the end (delta: 20.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.80ms. Allocated memory is still 174.1MB. Free memory was 116.2MB in the beginning and 113.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.39ms. Allocated memory is still 174.1MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 660.66ms. Allocated memory is still 174.1MB. Free memory was 111.9MB in the beginning and 91.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28464.23ms. Allocated memory was 174.1MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 90.3MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 941.8MB. Max. memory is 16.1GB. * Witness Printer took 10.47ms. Allocated memory is still 8.7GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 266 PlacesBefore, 154 PlacesAfterwards, 257 TransitionsBefore, 143 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 6 FixpointIterations, 108 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 187 TotalNumberOfCompositions, 10036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5416, independent: 5063, independent conditional: 0, independent unconditional: 5063, dependent: 353, dependent conditional: 0, dependent unconditional: 353, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1466, independent: 1392, independent conditional: 0, independent unconditional: 1392, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1466, independent: 1372, independent conditional: 0, independent unconditional: 1372, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 314, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5416, independent: 3671, independent conditional: 0, independent unconditional: 3671, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 1466, unknown conditional: 0, unknown unconditional: 1466] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 269, Positive conditional cache size: 0, Positive unconditional cache size: 269, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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 - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1123. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, pthread_create(&t, 0, thread0, 0)=-4, t={6:0}, v={0:0}] [L1163] 0 \read(t) VAL [\read(t)=-4, arg={0:0}, t={6:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-3, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] 1 \read(t1) VAL [\read(t1)=-3, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-3, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=-2, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t3, 0, thread3, 0)=-1, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t4, 0, thread2, 0)=0, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t5, 0, thread2, 0)=1, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=-1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={8:0}, t3={9:0}, t4={10:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\read(t)=-4, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={6:0}, v={3:0}] [L1164] EXPR 0 v[0] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' [L1164] EXPR 0 v[0] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1123] COND FALSE 0 !(!expression) [L1164] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1165] 0 return 0; [L1165] 0 return 0; - 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: 1152]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1147]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: 1123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1147]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1152]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 294 locations, 73 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1421 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1421 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2024 IncrementalHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 293 mSDtfsCounter, 2024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15707occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 3959 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 5704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:37:53,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 --- 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 23:37:55,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:37:55,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:37:55,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:37:55,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:37:55,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:37:55,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:37:55,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:37:55,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:37:55,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:37:55,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:37:55,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:37:55,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:37:55,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:37:55,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:37:55,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:37:55,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:37:55,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:37:55,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:37:55,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:37:55,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:37:55,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:37:55,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:37:55,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:37:55,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:37:55,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:37:55,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:37:55,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:37:55,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:37:55,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:37:55,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:37:55,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:37:55,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:37:55,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:37:55,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:37:55,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:37:55,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:37:55,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:37:55,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:37:55,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:37:55,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:37:55,807 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 23:37:55,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:37:55,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:37:55,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:37:55,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:37:55,837 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:37:55,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:37:55,838 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:37:55,838 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:37:55,838 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:37:55,838 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:37:55,839 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:37:55,839 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:37:55,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:37:55,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:37:55,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:37:55,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:37:55,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:37:55,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:37:55,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:37:55,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:37:55,842 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:37:55,842 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:37:55,842 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:37:55,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:37:55,843 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:37:55,843 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:37:55,843 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:37:55,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:37:55,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:37:55,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:37:55,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:37:55,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:37:55,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:37:55,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:37:55,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:37:55,846 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:37:55,846 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:37:55,846 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:37:55,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:37:55,847 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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 -> 9556b3eb7217f056a72a299bf0514e64606a248fa454b59dcc03e4a2e74c7c90 [2022-11-25 23:37:56,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:37:56,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:37:56,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:37:56,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:37:56,217 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:37:56,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2022-11-25 23:37:59,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:37:59,759 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:37:59,760 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2022-11-25 23:37:59,775 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data/e24505291/d0dd0fc9dfd5460ca836d58a2507acb2/FLAG6222beaed [2022-11-25 23:37:59,798 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/data/e24505291/d0dd0fc9dfd5460ca836d58a2507acb2 [2022-11-25 23:37:59,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:37:59,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:37:59,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:37:59,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:37:59,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:37:59,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:37:59" (1/1) ... [2022-11-25 23:37:59,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431babac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:37:59, skipping insertion in model container [2022-11-25 23:37:59,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:37:59" (1/1) ... [2022-11-25 23:37:59,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:37:59,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:38:00,119 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:38:00,556 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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i[55568,55581] [2022-11-25 23:38:00,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:38:00,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:38:00,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:38:00,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:38:00,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:38:00,598 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:38:00,627 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 23:38:00,653 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_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i[55568,55581] [2022-11-25 23:38:00,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:38:00,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:38:00,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:38:00,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:38:00,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:38:00,773 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:38:00,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00 WrapperNode [2022-11-25 23:38:00,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:38:00,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:38:00,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:38:00,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:38:00,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,879 INFO L138 Inliner]: procedures = 328, calls = 53, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2022-11-25 23:38:00,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:38:00,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:38:00,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:38:00,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:38:00,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:38:00,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:38:00,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:38:00,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:38:00,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (1/1) ... [2022-11-25 23:38:00,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:38:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:00,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:38:01,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:38:01,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 23:38:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 23:38:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:38:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:38:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-25 23:38:01,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:38:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 23:38:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:38:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:38:01,030 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2022-11-25 23:38:01,031 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2022-11-25 23:38:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 23:38:01,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 23:38:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 23:38:01,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 23:38:01,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 23:38:01,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 23:38:01,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:38:01,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:38:01,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:38:01,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:38:01,037 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:38:01,197 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:38:01,199 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:38:01,730 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:38:01,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:38:01,743 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:38:01,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:38:01 BoogieIcfgContainer [2022-11-25 23:38:01,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:38:01,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:38:01,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:38:01,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:38:01,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:37:59" (1/3) ... [2022-11-25 23:38:01,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7583d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:38:01, skipping insertion in model container [2022-11-25 23:38:01,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:38:00" (2/3) ... [2022-11-25 23:38:01,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7583d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:38:01, skipping insertion in model container [2022-11-25 23:38:01,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:38:01" (3/3) ... [2022-11-25 23:38:01,760 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2022-11-25 23:38:01,781 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:38:01,782 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-25 23:38:01,782 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:38:02,081 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2022-11-25 23:38:02,138 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:38:02,169 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 258 transitions, 623 flow [2022-11-25 23:38:02,174 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 258 transitions, 623 flow [2022-11-25 23:38:02,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 258 transitions, 623 flow [2022-11-25 23:38:02,310 INFO L130 PetriNetUnfolder]: 7/179 cut-off events. [2022-11-25 23:38:02,310 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-25 23:38:02,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 179 events. 7/179 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 176 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2022-11-25 23:38:02,321 INFO L119 LiptonReduction]: Number of co-enabled transitions 2920 [2022-11-25 23:38:21,986 INFO L134 LiptonReduction]: Checked pairs total: 9976 [2022-11-25 23:38:21,987 INFO L136 LiptonReduction]: Total number of compositions: 187 [2022-11-25 23:38:21,995 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 143 transitions, 393 flow [2022-11-25 23:38:23,327 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15707 states, 14485 states have (on average 4.8327925440110455) internal successors, (70003), 15706 states have internal predecessors, (70003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:23,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:38:23,406 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;@967ad47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:38:23,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2022-11-25 23:38:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 15707 states, 14485 states have (on average 4.8327925440110455) internal successors, (70003), 15706 states have internal predecessors, (70003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-25 23:38:23,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:23,492 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-25 23:38:23,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 701, now seen corresponding path program 1 times [2022-11-25 23:38:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:23,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411438815] [2022-11-25 23:38:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:23,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:23,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:23,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:23,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 23:38:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:23,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 23:38:23,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:23,651 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 23:38:23,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:23,652 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411438815] [2022-11-25 23:38:23,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411438815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:23,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:23,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 23:38:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021195313] [2022-11-25 23:38:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:38:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:38:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:38:23,726 INFO L87 Difference]: Start difference. First operand has 15707 states, 14485 states have (on average 4.8327925440110455) internal successors, (70003), 15706 states have internal predecessors, (70003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:24,776 INFO L93 Difference]: Finished difference Result 15703 states and 69999 transitions. [2022-11-25 23:38:24,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:38:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-25 23:38:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:25,136 INFO L225 Difference]: With dead ends: 15703 [2022-11-25 23:38:25,138 INFO L226 Difference]: Without dead ends: 15703 [2022-11-25 23:38:25,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:38:25,144 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:25,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:38:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15703 states. [2022-11-25 23:38:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15703 to 15703. [2022-11-25 23:38:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15703 states, 14485 states have (on average 4.8325163962720055) internal successors, (69999), 15702 states have internal predecessors, (69999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15703 states to 15703 states and 69999 transitions. [2022-11-25 23:38:26,446 INFO L78 Accepts]: Start accepts. Automaton has 15703 states and 69999 transitions. Word has length 1 [2022-11-25 23:38:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:26,448 INFO L495 AbstractCegarLoop]: Abstraction has 15703 states and 69999 transitions. [2022-11-25 23:38:26,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15703 states and 69999 transitions. [2022-11-25 23:38:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:38:26,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:26,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:38:26,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:26,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:26,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 690439, now seen corresponding path program 1 times [2022-11-25 23:38:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:26,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582718574] [2022-11-25 23:38:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:26,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:26,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:26,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:26,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 23:38:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:27,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:38:27,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:27,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:27,150 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 23:38:27,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:27,152 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:27,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582718574] [2022-11-25 23:38:27,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582718574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:27,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:27,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:38:27,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670382388] [2022-11-25 23:38:27,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:27,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:27,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:27,158 INFO L87 Difference]: Start difference. First operand 15703 states and 69999 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:27,769 INFO L93 Difference]: Finished difference Result 11793 states and 51538 transitions. [2022-11-25 23:38:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:27,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:38:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:27,869 INFO L225 Difference]: With dead ends: 11793 [2022-11-25 23:38:27,870 INFO L226 Difference]: Without dead ends: 11793 [2022-11-25 23:38:27,871 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 23:38:27,873 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:27,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 17 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:38:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2022-11-25 23:38:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11784. [2022-11-25 23:38:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11784 states, 10970 states have (on average 4.697265268915223) internal successors, (51529), 11783 states have internal predecessors, (51529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11784 states to 11784 states and 51529 transitions. [2022-11-25 23:38:28,612 INFO L78 Accepts]: Start accepts. Automaton has 11784 states and 51529 transitions. Word has length 3 [2022-11-25 23:38:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:28,612 INFO L495 AbstractCegarLoop]: Abstraction has 11784 states and 51529 transitions. [2022-11-25 23:38:28,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11784 states and 51529 transitions. [2022-11-25 23:38:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:38:28,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:28,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:38:28,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:28,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:28,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 690440, now seen corresponding path program 1 times [2022-11-25 23:38:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:28,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120683061] [2022-11-25 23:38:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:28,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:28,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:28,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 23:38:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:28,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:38:28,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:29,103 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 23:38:29,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:29,103 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:29,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120683061] [2022-11-25 23:38:29,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120683061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:29,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:29,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:38:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23419812] [2022-11-25 23:38:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:29,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:29,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:29,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:29,105 INFO L87 Difference]: Start difference. First operand 11784 states and 51529 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:30,274 INFO L93 Difference]: Finished difference Result 15710 states and 66086 transitions. [2022-11-25 23:38:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:38:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:30,406 INFO L225 Difference]: With dead ends: 15710 [2022-11-25 23:38:30,406 INFO L226 Difference]: Without dead ends: 15710 [2022-11-25 23:38:30,407 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 23:38:30,408 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:30,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:38:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15710 states. [2022-11-25 23:38:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15710 to 11783. [2022-11-25 23:38:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11783 states, 10969 states have (on average 4.69751116783663) internal successors, (51527), 11782 states have internal predecessors, (51527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 51527 transitions. [2022-11-25 23:38:31,358 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 51527 transitions. Word has length 3 [2022-11-25 23:38:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:31,359 INFO L495 AbstractCegarLoop]: Abstraction has 11783 states and 51527 transitions. [2022-11-25 23:38:31,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 51527 transitions. [2022-11-25 23:38:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:38:31,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:31,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:38:31,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-25 23:38:31,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:31,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 21401292, now seen corresponding path program 1 times [2022-11-25 23:38:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399903880] [2022-11-25 23:38:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:31,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:31,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:31,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:31,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 23:38:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:31,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:38:31,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:31,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:31,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:31,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:31,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-25 23:38:31,952 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:38:31,953 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 13 treesize of output 13 [2022-11-25 23:38:31,996 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 23:38:31,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:31,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399903880] [2022-11-25 23:38:32,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399903880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:32,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:32,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897053860] [2022-11-25 23:38:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:32,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:38:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:38:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:38:32,010 INFO L87 Difference]: Start difference. First operand 11783 states and 51527 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:32,565 INFO L93 Difference]: Finished difference Result 7869 states and 33059 transitions. [2022-11-25 23:38:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:38:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:38:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:32,625 INFO L225 Difference]: With dead ends: 7869 [2022-11-25 23:38:32,626 INFO L226 Difference]: Without dead ends: 7869 [2022-11-25 23:38:32,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:38:32,627 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:32,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 10 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:38:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7869 states. [2022-11-25 23:38:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7869 to 7860. [2022-11-25 23:38:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7860 states, 7451 states have (on average 4.435646221983626) internal successors, (33050), 7859 states have internal predecessors, (33050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7860 states to 7860 states and 33050 transitions. [2022-11-25 23:38:33,021 INFO L78 Accepts]: Start accepts. Automaton has 7860 states and 33050 transitions. Word has length 4 [2022-11-25 23:38:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 7860 states and 33050 transitions. [2022-11-25 23:38:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7860 states and 33050 transitions. [2022-11-25 23:38:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:38:33,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:33,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:33,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:33,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:33,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1903351238, now seen corresponding path program 1 times [2022-11-25 23:38:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:33,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421549510] [2022-11-25 23:38:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:33,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:33,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:33,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 23:38:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:33,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 23:38:33,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:33,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:33,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:33,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:33,460 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:33,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:33,833 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:38:33,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:38:33,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-25 23:38:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:34,051 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:38:34,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-25 23:38:34,109 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-25 23:38:34,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:38:34,143 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 23:38:34,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:34,144 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:34,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421549510] [2022-11-25 23:38:34,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421549510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:34,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:34,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:38:34,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190701334] [2022-11-25 23:38:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:34,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:38:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:38:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:38:34,147 INFO L87 Difference]: Start difference. First operand 7860 states and 33050 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:35,107 INFO L93 Difference]: Finished difference Result 7848 states and 33028 transitions. [2022-11-25 23:38:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:38:35,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:38:35,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:35,166 INFO L225 Difference]: With dead ends: 7848 [2022-11-25 23:38:35,166 INFO L226 Difference]: Without dead ends: 7848 [2022-11-25 23:38:35,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:38:35,168 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:35,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 20 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:38:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2022-11-25 23:38:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 7848. [2022-11-25 23:38:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7848 states, 7443 states have (on average 4.437458014241569) internal successors, (33028), 7847 states have internal predecessors, (33028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7848 states to 7848 states and 33028 transitions. [2022-11-25 23:38:35,498 INFO L78 Accepts]: Start accepts. Automaton has 7848 states and 33028 transitions. Word has length 7 [2022-11-25 23:38:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:35,499 INFO L495 AbstractCegarLoop]: Abstraction has 7848 states and 33028 transitions. [2022-11-25 23:38:35,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7848 states and 33028 transitions. [2022-11-25 23:38:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:38:35,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:35,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:35,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:35,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:35,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1794188758, now seen corresponding path program 1 times [2022-11-25 23:38:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:35,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103443996] [2022-11-25 23:38:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:35,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:35,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:35,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:35,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 23:38:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:36,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:38:36,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:36,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:36,124 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:36,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:36,182 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:36,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:36,232 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:36,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:36,284 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:38:36,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:36,309 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 23:38:36,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:36,310 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103443996] [2022-11-25 23:38:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103443996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:36,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655817536] [2022-11-25 23:38:36,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:36,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:36,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:36,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:36,313 INFO L87 Difference]: Start difference. First operand 7848 states and 33028 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:36,635 INFO L93 Difference]: Finished difference Result 6596 states and 27150 transitions. [2022-11-25 23:38:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:36,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:38:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:36,679 INFO L225 Difference]: With dead ends: 6596 [2022-11-25 23:38:36,679 INFO L226 Difference]: Without dead ends: 6596 [2022-11-25 23:38:36,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 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 23:38:36,681 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:36,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 18 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:38:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2022-11-25 23:38:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 6596. [2022-11-25 23:38:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6273 states have (on average 4.328072692491631) internal successors, (27150), 6595 states have internal predecessors, (27150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 27150 transitions. [2022-11-25 23:38:36,951 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 27150 transitions. Word has length 14 [2022-11-25 23:38:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:36,953 INFO L495 AbstractCegarLoop]: Abstraction has 6596 states and 27150 transitions. [2022-11-25 23:38:36,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 27150 transitions. [2022-11-25 23:38:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:38:36,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:36,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:36,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-25 23:38:37,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:37,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:37,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1794188757, now seen corresponding path program 1 times [2022-11-25 23:38:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:37,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678396656] [2022-11-25 23:38:37,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:37,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:37,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:37,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 23:38:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:37,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:38:37,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:37,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:37,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:37,489 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:37,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:37,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:37,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:37,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:37,574 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:37,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:37,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:37,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:37,623 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:38:37,624 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 13 treesize of output 13 [2022-11-25 23:38:37,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:37,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:37,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 23:38:37,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:37,790 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678396656] [2022-11-25 23:38:37,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678396656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:37,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:37,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:38:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965607925] [2022-11-25 23:38:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:38:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:38:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:38:37,792 INFO L87 Difference]: Start difference. First operand 6596 states and 27150 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:38,456 INFO L93 Difference]: Finished difference Result 5344 states and 21272 transitions. [2022-11-25 23:38:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:38:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:38:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:38,478 INFO L225 Difference]: With dead ends: 5344 [2022-11-25 23:38:38,478 INFO L226 Difference]: Without dead ends: 5344 [2022-11-25 23:38:38,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:38:38,479 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 176 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:38,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 13 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:38:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2022-11-25 23:38:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2022-11-25 23:38:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5103 states have (on average 4.168528316676465) internal successors, (21272), 5343 states have internal predecessors, (21272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 21272 transitions. [2022-11-25 23:38:38,651 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 21272 transitions. Word has length 14 [2022-11-25 23:38:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:38,652 INFO L495 AbstractCegarLoop]: Abstraction has 5344 states and 21272 transitions. [2022-11-25 23:38:38,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 21272 transitions. [2022-11-25 23:38:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:38:38,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:38,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:38,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:38,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:38,872 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1933496660, now seen corresponding path program 1 times [2022-11-25 23:38:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:38,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953768289] [2022-11-25 23:38:38,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:38,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:38,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:38,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:38,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 23:38:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:39,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:38:39,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:39,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:39,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:39,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:39,185 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:39,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:39,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:39,256 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:38:39,256 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 13 treesize of output 13 [2022-11-25 23:38:39,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:39,466 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 23:38:39,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:39,466 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:39,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953768289] [2022-11-25 23:38:39,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953768289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:39,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:39,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:38:39,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599363349] [2022-11-25 23:38:39,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:39,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:38:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:39,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:38:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:38:39,469 INFO L87 Difference]: Start difference. First operand 5344 states and 21272 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:40,091 INFO L93 Difference]: Finished difference Result 4824 states and 19276 transitions. [2022-11-25 23:38:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:38:40,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:38:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:40,113 INFO L225 Difference]: With dead ends: 4824 [2022-11-25 23:38:40,113 INFO L226 Difference]: Without dead ends: 4824 [2022-11-25 23:38:40,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:38:40,114 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:40,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 11 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:38:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2022-11-25 23:38:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4824. [2022-11-25 23:38:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4824 states, 4643 states have (on average 4.15162610381219) internal successors, (19276), 4823 states have internal predecessors, (19276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 19276 transitions. [2022-11-25 23:38:40,419 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 19276 transitions. Word has length 16 [2022-11-25 23:38:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:40,420 INFO L495 AbstractCegarLoop]: Abstraction has 4824 states and 19276 transitions. [2022-11-25 23:38:40,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 19276 transitions. [2022-11-25 23:38:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:38:40,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:40,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:40,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:40,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:40,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 191139049, now seen corresponding path program 1 times [2022-11-25 23:38:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:40,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922439227] [2022-11-25 23:38:40,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:40,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:40,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:40,652 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:40,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 23:38:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:40,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:38:40,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:40,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:40,831 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 23:38:40,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:40,832 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:40,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922439227] [2022-11-25 23:38:40,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922439227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:40,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:40,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80114619] [2022-11-25 23:38:40,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:40,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:40,836 INFO L87 Difference]: Start difference. First operand 4824 states and 19276 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:41,116 INFO L93 Difference]: Finished difference Result 2318 states and 8699 transitions. [2022-11-25 23:38:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:38:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:41,127 INFO L225 Difference]: With dead ends: 2318 [2022-11-25 23:38:41,127 INFO L226 Difference]: Without dead ends: 2318 [2022-11-25 23:38:41,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 23:38:41,128 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:41,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 15 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:38:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-11-25 23:38:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2022-11-25 23:38:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2262 states have (on average 3.845711759504863) internal successors, (8699), 2317 states have internal predecessors, (8699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 8699 transitions. [2022-11-25 23:38:41,235 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 8699 transitions. Word has length 17 [2022-11-25 23:38:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:41,236 INFO L495 AbstractCegarLoop]: Abstraction has 2318 states and 8699 transitions. [2022-11-25 23:38:41,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 8699 transitions. [2022-11-25 23:38:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:38:41,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:41,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:41,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-25 23:38:41,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:41,452 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 191139050, now seen corresponding path program 1 times [2022-11-25 23:38:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:41,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088076453] [2022-11-25 23:38:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:41,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:41,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:41,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 23:38:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:41,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:38:41,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:41,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:41,662 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 23:38:41,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:41,663 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:41,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088076453] [2022-11-25 23:38:41,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088076453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:41,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:41,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519616215] [2022-11-25 23:38:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:41,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:41,666 INFO L87 Difference]: Start difference. First operand 2318 states and 8699 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:41,875 INFO L93 Difference]: Finished difference Result 959 states and 3223 transitions. [2022-11-25 23:38:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:41,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 23:38:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:41,879 INFO L225 Difference]: With dead ends: 959 [2022-11-25 23:38:41,880 INFO L226 Difference]: Without dead ends: 959 [2022-11-25 23:38:41,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 23:38:41,881 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:41,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 15 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:38:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-11-25 23:38:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2022-11-25 23:38:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 947 states have (on average 3.40337909186906) internal successors, (3223), 958 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 3223 transitions. [2022-11-25 23:38:41,911 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 3223 transitions. Word has length 17 [2022-11-25 23:38:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:41,911 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 3223 transitions. [2022-11-25 23:38:41,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 3223 transitions. [2022-11-25 23:38:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:38:41,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:41,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:41,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-25 23:38:42,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:42,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1630564969, now seen corresponding path program 1 times [2022-11-25 23:38:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:42,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300557076] [2022-11-25 23:38:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:42,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:42,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:42,117 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:42,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 23:38:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:42,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 23:38:42,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:42,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:42,301 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:42,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:42,337 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:38:42,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:42,366 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 23:38:42,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:42,366 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300557076] [2022-11-25 23:38:42,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300557076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:42,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:42,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997205342] [2022-11-25 23:38:42,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:42,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:42,368 INFO L87 Difference]: Start difference. First operand 959 states and 3223 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:42,547 INFO L93 Difference]: Finished difference Result 923 states and 3121 transitions. [2022-11-25 23:38:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:42,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:38:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:42,551 INFO L225 Difference]: With dead ends: 923 [2022-11-25 23:38:42,551 INFO L226 Difference]: Without dead ends: 923 [2022-11-25 23:38:42,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 1 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 23:38:42,552 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:42,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 14 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:38:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-25 23:38:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2022-11-25 23:38:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 913 states have (on average 3.4184008762322016) internal successors, (3121), 922 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 3121 transitions. [2022-11-25 23:38:42,578 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 3121 transitions. Word has length 18 [2022-11-25 23:38:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:42,578 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 3121 transitions. [2022-11-25 23:38:42,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 3121 transitions. [2022-11-25 23:38:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:38:42,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:42,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:42,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-25 23:38:42,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:42,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1630564970, now seen corresponding path program 1 times [2022-11-25 23:38:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:42,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957709851] [2022-11-25 23:38:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:42,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:42,795 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:42,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 23:38:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:42,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:38:42,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:42,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:42,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:43,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:43,034 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:38:43,034 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 13 treesize of output 13 [2022-11-25 23:38:43,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:43,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:43,282 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 23:38:43,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:43,283 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957709851] [2022-11-25 23:38:43,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957709851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:43,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:43,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:38:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194468752] [2022-11-25 23:38:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:43,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:38:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:43,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:38:43,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:38:43,286 INFO L87 Difference]: Start difference. First operand 923 states and 3121 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:43,677 INFO L93 Difference]: Finished difference Result 887 states and 3019 transitions. [2022-11-25 23:38:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:38:43,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:38:43,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:43,680 INFO L225 Difference]: With dead ends: 887 [2022-11-25 23:38:43,680 INFO L226 Difference]: Without dead ends: 887 [2022-11-25 23:38:43,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:38:43,681 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:43,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 13 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:38:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-11-25 23:38:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2022-11-25 23:38:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 879 states have (on average 3.434584755403868) internal successors, (3019), 886 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3019 transitions. [2022-11-25 23:38:43,703 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3019 transitions. Word has length 18 [2022-11-25 23:38:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:43,704 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 3019 transitions. [2022-11-25 23:38:43,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3019 transitions. [2022-11-25 23:38:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:38:43,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:43,705 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 23:38:43,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:43,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:43,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -690110749, now seen corresponding path program 1 times [2022-11-25 23:38:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:43,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080109586] [2022-11-25 23:38:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:43,911 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:43,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 23:38:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:44,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:38:44,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:44,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:44,094 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:38:44,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:44,128 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 23:38:44,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:44,128 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080109586] [2022-11-25 23:38:44,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080109586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:44,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:44,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:38:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240298900] [2022-11-25 23:38:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:44,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:38:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:38:44,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:38:44,131 INFO L87 Difference]: Start difference. First operand 887 states and 3019 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:44,315 INFO L93 Difference]: Finished difference Result 827 states and 2817 transitions. [2022-11-25 23:38:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:38:44,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:38:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:44,319 INFO L225 Difference]: With dead ends: 827 [2022-11-25 23:38:44,319 INFO L226 Difference]: Without dead ends: 827 [2022-11-25 23:38:44,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 1 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 23:38:44,320 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:44,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:38:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-11-25 23:38:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-11-25 23:38:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 821 states have (on average 3.431181485992692) internal successors, (2817), 826 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2817 transitions. [2022-11-25 23:38:44,343 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2817 transitions. Word has length 20 [2022-11-25 23:38:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:44,343 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 2817 transitions. [2022-11-25 23:38:44,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2817 transitions. [2022-11-25 23:38:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:38:44,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:44,344 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 23:38:44,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:44,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:44,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -690110748, now seen corresponding path program 1 times [2022-11-25 23:38:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:44,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137140116] [2022-11-25 23:38:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:44,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:44,551 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:44,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 23:38:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:44,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:38:44,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:44,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:44,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:44,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:44,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:38:44,868 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:38:44,869 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 13 treesize of output 13 [2022-11-25 23:38:44,932 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 23:38:44,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:44,932 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:44,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137140116] [2022-11-25 23:38:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137140116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:44,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:44,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:38:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226741708] [2022-11-25 23:38:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:44,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:38:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:38:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:38:44,935 INFO L87 Difference]: Start difference. First operand 827 states and 2817 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:45,186 INFO L93 Difference]: Finished difference Result 767 states and 2615 transitions. [2022-11-25 23:38:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:38:45,186 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:38:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:45,190 INFO L225 Difference]: With dead ends: 767 [2022-11-25 23:38:45,190 INFO L226 Difference]: Without dead ends: 767 [2022-11-25 23:38:45,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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 23:38:45,191 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:45,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 13 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:38:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-11-25 23:38:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2022-11-25 23:38:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 763 states have (on average 3.4272608125819133) internal successors, (2615), 766 states have internal predecessors, (2615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2615 transitions. [2022-11-25 23:38:45,253 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2615 transitions. Word has length 20 [2022-11-25 23:38:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:45,253 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 2615 transitions. [2022-11-25 23:38:45,253 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2615 transitions. [2022-11-25 23:38:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:38:45,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:45,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:45,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:45,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1115613542, now seen corresponding path program 1 times [2022-11-25 23:38:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:45,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133421027] [2022-11-25 23:38:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:45,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:45,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:45,462 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:45,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 23:38:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:45,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 23:38:45,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:45,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:45,842 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:45,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:45,907 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:45,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:45,965 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:45,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:46,012 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:38:46,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 24 [2022-11-25 23:38:46,095 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:38:46,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-25 23:38:46,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:46,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2022-11-25 23:38:47,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:47,466 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 23:38:47,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:47,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:47,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133421027] [2022-11-25 23:38:47,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133421027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:47,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:47,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:38:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884702643] [2022-11-25 23:38:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:47,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:38:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:38:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:38:47,469 INFO L87 Difference]: Start difference. First operand 767 states and 2615 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:48,079 INFO L93 Difference]: Finished difference Result 766 states and 2613 transitions. [2022-11-25 23:38:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:38:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-25 23:38:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:48,083 INFO L225 Difference]: With dead ends: 766 [2022-11-25 23:38:48,083 INFO L226 Difference]: Without dead ends: 766 [2022-11-25 23:38:48,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:38:48,084 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:48,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 10 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:38:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-11-25 23:38:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2022-11-25 23:38:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 762 states have (on average 3.4291338582677167) internal successors, (2613), 765 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2613 transitions. [2022-11-25 23:38:48,101 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2613 transitions. Word has length 43 [2022-11-25 23:38:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:48,102 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 2613 transitions. [2022-11-25 23:38:48,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2613 transitions. [2022-11-25 23:38:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 23:38:48,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:48,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:48,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:48,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:48,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash 224279271, now seen corresponding path program 1 times [2022-11-25 23:38:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:48,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734963954] [2022-11-25 23:38:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:48,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:48,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:48,312 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:48,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 23:38:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:48,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 23:38:48,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:48,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:48,667 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:48,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:48,725 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:48,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:48,805 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:48,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:48,855 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:48,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:48,904 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:48,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:48,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:48,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-25 23:38:49,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:49,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:49,900 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 23:38:49,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:49,900 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:49,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734963954] [2022-11-25 23:38:49,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734963954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:49,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:49,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:38:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110449736] [2022-11-25 23:38:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:49,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:38:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:49,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:38:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:38:49,903 INFO L87 Difference]: Start difference. First operand 766 states and 2613 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:50,532 INFO L93 Difference]: Finished difference Result 765 states and 2611 transitions. [2022-11-25 23:38:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:38:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 23:38:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:50,536 INFO L225 Difference]: With dead ends: 765 [2022-11-25 23:38:50,536 INFO L226 Difference]: Without dead ends: 765 [2022-11-25 23:38:50,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:38:50,537 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:50,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 9 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:38:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-25 23:38:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2022-11-25 23:38:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 761 states have (on average 3.431011826544021) internal successors, (2611), 764 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2611 transitions. [2022-11-25 23:38:50,559 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2611 transitions. Word has length 44 [2022-11-25 23:38:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:50,560 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 2611 transitions. [2022-11-25 23:38:50,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2611 transitions. [2022-11-25 23:38:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:38:50,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:50,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:50,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:50,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:50,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:50,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1637282299, now seen corresponding path program 1 times [2022-11-25 23:38:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:50,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338462854] [2022-11-25 23:38:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:50,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:50,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:50,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:50,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 23:38:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:51,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:38:51,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:51,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:51,215 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:51,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:51,331 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:38:51,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:38:51,498 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:38:51,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:38:51,688 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:38:51,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:38:51,877 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:38:51,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:38:52,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:52,148 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:38:52,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2022-11-25 23:38:55,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2022-11-25 23:38:55,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:55,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:38:55,607 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 23:38:55,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:55,607 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:38:55,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338462854] [2022-11-25 23:38:55,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338462854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:55,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:55,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:38:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105193051] [2022-11-25 23:38:55,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:55,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:38:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:38:55,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:38:55,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:38:55,610 INFO L87 Difference]: Start difference. First operand 765 states and 2611 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:56,654 INFO L93 Difference]: Finished difference Result 764 states and 2609 transitions. [2022-11-25 23:38:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:38:56,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 23:38:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:56,657 INFO L225 Difference]: With dead ends: 764 [2022-11-25 23:38:56,657 INFO L226 Difference]: Without dead ends: 764 [2022-11-25 23:38:56,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:38:56,658 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:56,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 9 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:38:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-25 23:38:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2022-11-25 23:38:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 760 states have (on average 3.432894736842105) internal successors, (2609), 763 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2609 transitions. [2022-11-25 23:38:56,678 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2609 transitions. Word has length 45 [2022-11-25 23:38:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:56,679 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 2609 transitions. [2022-11-25 23:38:56,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:38:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2609 transitions. [2022-11-25 23:38:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 23:38:56,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:56,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:56,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:56,898 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:38:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash 783854864, now seen corresponding path program 1 times [2022-11-25 23:38:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:38:56,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900532124] [2022-11-25 23:38:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:38:56,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:38:56,901 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:38:56,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 23:38:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:57,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 23:38:57,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:57,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:38:57,265 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:57,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:57,341 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:57,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:57,436 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:57,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:57,533 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:38:57,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:38:57,724 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:38:57,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:38:57,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:57,953 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:38:57,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2022-11-25 23:39:00,548 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:39:00,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 52 [2022-11-25 23:39:00,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-25 23:39:00,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:39:00,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:39:01,067 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 23:39:01,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:39:01,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:39:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900532124] [2022-11-25 23:39:01,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900532124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:01,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:39:01,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:39:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251386880] [2022-11-25 23:39:01,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:01,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:39:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:39:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:39:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:39:01,070 INFO L87 Difference]: Start difference. First operand 764 states and 2609 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:02,079 INFO L93 Difference]: Finished difference Result 763 states and 2607 transitions. [2022-11-25 23:39:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:39:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-25 23:39:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:02,082 INFO L225 Difference]: With dead ends: 763 [2022-11-25 23:39:02,082 INFO L226 Difference]: Without dead ends: 763 [2022-11-25 23:39:02,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:39:02,083 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:02,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 9 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:39:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-11-25 23:39:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 763. [2022-11-25 23:39:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 759 states have (on average 3.4347826086956523) internal successors, (2607), 762 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 2607 transitions. [2022-11-25 23:39:02,105 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 2607 transitions. Word has length 46 [2022-11-25 23:39:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:02,106 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 2607 transitions. [2022-11-25 23:39:02,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 2607 transitions. [2022-11-25 23:39:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 23:39:02,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:02,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:02,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:02,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:02,309 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:39:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1470302272, now seen corresponding path program 1 times [2022-11-25 23:39:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:39:02,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358079137] [2022-11-25 23:39:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:39:02,312 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:39:02,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 23:39:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:02,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 23:39:02,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:02,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 23:39:02,645 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:39:02,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:39:02,711 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:39:02,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:39:02,786 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:39:02,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:39:02,868 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:39:02,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 23:39:03,025 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 23:39:03,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 23:39:03,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:03,516 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:39:03,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2022-11-25 23:39:07,536 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:39:07,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 52 [2022-11-25 23:39:08,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:39:08,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-25 23:39:08,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-25 23:39:08,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:39:08,532 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 23:39:08,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:39:08,532 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:39:08,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358079137] [2022-11-25 23:39:08,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358079137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:08,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:39:08,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:39:08,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125782971] [2022-11-25 23:39:08,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:08,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:39:08,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:39:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:39:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:39:08,535 INFO L87 Difference]: Start difference. First operand 763 states and 2607 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:10,000 INFO L93 Difference]: Finished difference Result 762 states and 2606 transitions. [2022-11-25 23:39:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:39:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-11-25 23:39:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:10,003 INFO L225 Difference]: With dead ends: 762 [2022-11-25 23:39:10,004 INFO L226 Difference]: Without dead ends: 762 [2022-11-25 23:39:10,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:39:10,005 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:10,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 9 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:39:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-11-25 23:39:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2022-11-25 23:39:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 759 states have (on average 3.4334650856389985) internal successors, (2606), 761 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 2606 transitions. [2022-11-25 23:39:10,028 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 2606 transitions. Word has length 47 [2022-11-25 23:39:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:10,028 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 2606 transitions. [2022-11-25 23:39:10,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 2606 transitions. [2022-11-25 23:39:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 23:39:10,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:10,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:10,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:10,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:10,244 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:39:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 909271888, now seen corresponding path program 1 times [2022-11-25 23:39:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:39:10,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405695557] [2022-11-25 23:39:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:10,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:39:10,247 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:39:10,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 23:39:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:10,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:39:10,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:10,436 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 12 treesize of output 8 [2022-11-25 23:39:10,494 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 23:39:10,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:39:10,494 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:39:10,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405695557] [2022-11-25 23:39:10,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405695557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:10,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:39:10,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:39:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551615848] [2022-11-25 23:39:10,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:10,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:39:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:39:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:39:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:39:10,496 INFO L87 Difference]: Start difference. First operand 762 states and 2606 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:10,746 INFO L93 Difference]: Finished difference Result 1195 states and 4012 transitions. [2022-11-25 23:39:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:39:10,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-25 23:39:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:10,749 INFO L225 Difference]: With dead ends: 1195 [2022-11-25 23:39:10,750 INFO L226 Difference]: Without dead ends: 1195 [2022-11-25 23:39:10,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 23:39:10,750 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:10,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:39:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-25 23:39:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 799. [2022-11-25 23:39:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 796 states have (on average 3.3530150753768844) internal successors, (2669), 798 states have internal predecessors, (2669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2669 transitions. [2022-11-25 23:39:10,782 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2669 transitions. Word has length 49 [2022-11-25 23:39:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:10,782 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 2669 transitions. [2022-11-25 23:39:10,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:39:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2669 transitions. [2022-11-25 23:39:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 23:39:10,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:10,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:10,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-11-25 23:39:10,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:10,999 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2022-11-25 23:39:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 909271890, now seen corresponding path program 1 times [2022-11-25 23:39:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:39:10,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799268326] [2022-11-25 23:39:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:39:11,001 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:39:11,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 23:39:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:39:11,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 23:39:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 23:39:11,621 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-25 23:39:11,621 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 23:39:11,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (72 of 73 remaining) [2022-11-25 23:39:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 73 remaining) [2022-11-25 23:39:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 73 remaining) [2022-11-25 23:39:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 73 remaining) [2022-11-25 23:39:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 73 remaining) [2022-11-25 23:39:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 73 remaining) [2022-11-25 23:39:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 73 remaining) [2022-11-25 23:39:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 73 remaining) [2022-11-25 23:39:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 73 remaining) [2022-11-25 23:39:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 73 remaining) [2022-11-25 23:39:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 73 remaining) [2022-11-25 23:39:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 73 remaining) [2022-11-25 23:39:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 73 remaining) [2022-11-25 23:39:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 73 remaining) [2022-11-25 23:39:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 73 remaining) [2022-11-25 23:39:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 73 remaining) [2022-11-25 23:39:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 73 remaining) [2022-11-25 23:39:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 73 remaining) [2022-11-25 23:39:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 73 remaining) [2022-11-25 23:39:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 73 remaining) [2022-11-25 23:39:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 73 remaining) [2022-11-25 23:39:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 73 remaining) [2022-11-25 23:39:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 73 remaining) [2022-11-25 23:39:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 73 remaining) [2022-11-25 23:39:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 73 remaining) [2022-11-25 23:39:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 73 remaining) [2022-11-25 23:39:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 73 remaining) [2022-11-25 23:39:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 73 remaining) [2022-11-25 23:39:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 73 remaining) [2022-11-25 23:39:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 73 remaining) [2022-11-25 23:39:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 73 remaining) [2022-11-25 23:39:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 73 remaining) [2022-11-25 23:39:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 73 remaining) [2022-11-25 23:39:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 73 remaining) [2022-11-25 23:39:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 73 remaining) [2022-11-25 23:39:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 73 remaining) [2022-11-25 23:39:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 73 remaining) [2022-11-25 23:39:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 73 remaining) [2022-11-25 23:39:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (34 of 73 remaining) [2022-11-25 23:39:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 73 remaining) [2022-11-25 23:39:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 73 remaining) [2022-11-25 23:39:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 73 remaining) [2022-11-25 23:39:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 73 remaining) [2022-11-25 23:39:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 73 remaining) [2022-11-25 23:39:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 73 remaining) [2022-11-25 23:39:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 73 remaining) [2022-11-25 23:39:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 73 remaining) [2022-11-25 23:39:11,637 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 73 remaining) [2022-11-25 23:39:11,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 73 remaining) [2022-11-25 23:39:11,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 73 remaining) [2022-11-25 23:39:11,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 73 remaining) [2022-11-25 23:39:11,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 73 remaining) [2022-11-25 23:39:11,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 73 remaining) [2022-11-25 23:39:11,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 73 remaining) [2022-11-25 23:39:11,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 73 remaining) [2022-11-25 23:39:11,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 73 remaining) [2022-11-25 23:39:11,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 73 remaining) [2022-11-25 23:39:11,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 73 remaining) [2022-11-25 23:39:11,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 73 remaining) [2022-11-25 23:39:11,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 73 remaining) [2022-11-25 23:39:11,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 73 remaining) [2022-11-25 23:39:11,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 73 remaining) [2022-11-25 23:39:11,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 73 remaining) [2022-11-25 23:39:11,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 73 remaining) [2022-11-25 23:39:11,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 73 remaining) [2022-11-25 23:39:11,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 73 remaining) [2022-11-25 23:39:11,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 73 remaining) [2022-11-25 23:39:11,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 73 remaining) [2022-11-25 23:39:11,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 73 remaining) [2022-11-25 23:39:11,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 73 remaining) [2022-11-25 23:39:11,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 73 remaining) [2022-11-25 23:39:11,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 73 remaining) [2022-11-25 23:39:11,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 73 remaining) [2022-11-25 23:39:11,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:11,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:39:11,861 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] [2022-11-25 23:39:11,867 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 23:39:11,867 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:39:12,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:39:12 BasicIcfg [2022-11-25 23:39:12,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:39:12,024 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:39:12,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:39:12,024 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:39:12,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:38:01" (3/4) ... [2022-11-25 23:39:12,036 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 23:39:12,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:39:12,037 INFO L158 Benchmark]: Toolchain (without parser) took 72231.41ms. Allocated memory was 73.4MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 50.2MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2022-11-25 23:39:12,037 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:39:12,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 964.58ms. Allocated memory is still 73.4MB. Free memory was 50.0MB in the beginning and 31.4MB in the end (delta: 18.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-11-25 23:39:12,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.67ms. Allocated memory is still 73.4MB. Free memory was 31.4MB in the beginning and 51.1MB in the end (delta: -19.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-11-25 23:39:12,039 INFO L158 Benchmark]: Boogie Preprocessor took 50.28ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 49.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:39:12,041 INFO L158 Benchmark]: RCFGBuilder took 815.04ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 47.6MB in the end (delta: 1.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 23:39:12,041 INFO L158 Benchmark]: TraceAbstraction took 70273.41ms. Allocated memory was 73.4MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 47.1MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2022-11-25 23:39:12,041 INFO L158 Benchmark]: Witness Printer took 12.38ms. Allocated memory is still 7.7GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:39:12,042 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.24ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 964.58ms. Allocated memory is still 73.4MB. Free memory was 50.0MB in the beginning and 31.4MB in the end (delta: 18.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.67ms. Allocated memory is still 73.4MB. Free memory was 31.4MB in the beginning and 51.1MB in the end (delta: -19.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.28ms. Allocated memory is still 73.4MB. Free memory was 51.1MB in the beginning and 49.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 815.04ms. Allocated memory is still 73.4MB. Free memory was 49.1MB in the beginning and 47.6MB in the end (delta: 1.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 70273.41ms. Allocated memory was 73.4MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 47.1MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 12.38ms. Allocated memory is still 7.7GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.8s, 267 PlacesBefore, 154 PlacesAfterwards, 258 TransitionsBefore, 143 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 6 FixpointIterations, 111 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 0 ConcurrentYvCompositions, 2 ChoiceCompositions, 187 TotalNumberOfCompositions, 9976 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5474, independent: 5112, independent conditional: 0, independent unconditional: 5112, dependent: 362, dependent conditional: 0, dependent unconditional: 362, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1483, independent: 1404, independent conditional: 0, independent unconditional: 1404, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1483, independent: 1384, independent conditional: 0, independent unconditional: 1384, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 936, independent: 167, independent conditional: 0, independent unconditional: 167, dependent: 769, dependent conditional: 0, dependent unconditional: 769, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5474, independent: 3708, independent conditional: 0, independent unconditional: 3708, dependent: 283, dependent conditional: 0, dependent unconditional: 283, unknown: 1483, unknown conditional: 0, unknown unconditional: 1483] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 286, Positive conditional cache size: 0, Positive unconditional cache size: 286, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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 - UnprovableResult [Line: 1159]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1123. Possible FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, pthread_create(&t, 0, thread0, 0)=0, t={23:0}, v={0:0}] [L1163] 0 \read(t) VAL [\read(t)=0, arg={0:0}, t={23:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=1, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=1, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=1, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=2, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t3, 0, thread3, 0)=3, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t4, 0, thread2, 0)=4, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t5, 0, thread2, 0)=5, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=5, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=5, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1={54:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t2={22:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t3={55:0}, t4={30:0}, t5={48:0}, v={3:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\read(t)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t={23:0}, v={3:0}] [L1164] EXPR 0 v[0] [L1164] EXPR 0 v[0] == 'X' || v[0] == 'Y' [L1164] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1123] COND FALSE 0 !(!expression) [L1164] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L1165] 0 return 0; [L1165] 0 return 0; - 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: 1152]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1147]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) 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: 1123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1162]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1150]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1152]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1149]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1151]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1147]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 295 locations, 73 error locations. Started 1 CEGAR loops. OverallTime: 69.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1618 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1618 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2061 IncrementalHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 300 mSDtfsCounter, 2061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15707occurred in iteration=0, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 4341 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 426 ConstructedInterpolants, 187 QuantifiedInterpolants, 9629 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2962 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 23:39:12,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0155d4bc-3879-4ddc-991e-9341ae5c5bf4/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 Result: UNKNOWN: Overapproximated counterexample