./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:49:55,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:49:55,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:49:55,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:49:55,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:49:55,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:49:55,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:49:55,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:49:55,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:49:55,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:49:55,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:49:55,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:49:55,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:49:55,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:49:55,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:49:55,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:49:55,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:49:55,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:49:55,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:49:55,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:49:55,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:49:55,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:49:55,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:49:55,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:49:56,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:49:56,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:49:56,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:49:56,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:49:56,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:49:56,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:49:56,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:49:56,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:49:56,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:49:56,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:49:56,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:49:56,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:49:56,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:49:56,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:49:56,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:49:56,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:49:56,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:49:56,019 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 01:49:56,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:49:56,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:49:56,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:49:56,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:49:56,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:49:56,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:49:56,074 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:49:56,075 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:49:56,075 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:49:56,075 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:49:56,076 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:49:56,076 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:49:56,077 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:49:56,077 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:49:56,077 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:49:56,077 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:49:56,078 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:49:56,078 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:49:56,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:49:56,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:49:56,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:49:56,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:49:56,080 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:49:56,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:49:56,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:49:56,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:49:56,080 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:49:56,081 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:49:56,081 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:49:56,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:49:56,082 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:49:56,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:49:56,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:49:56,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:49:56,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:49:56,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:49:56,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:49:56,083 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:49:56,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:49:56,084 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:49:56,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:49:56,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:49:56,084 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_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2022-11-22 01:49:56,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:49:56,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:49:56,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:49:56,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:49:56,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:49:56,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:49:59,602 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:49:59,977 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:49:59,978 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:49:59,993 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data/619e0cd51/f1561d2d43a3403cac10b735c99872d7/FLAG141eccd19 [2022-11-22 01:50:00,008 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data/619e0cd51/f1561d2d43a3403cac10b735c99872d7 [2022-11-22 01:50:00,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:50:00,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:50:00,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:50:00,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:50:00,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:50:00,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4161f7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00, skipping insertion in model container [2022-11-22 01:50:00,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:50:00,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:50:00,305 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_b188a040-112e-4d5f-8b44-5b20295a249d/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-22 01:50:00,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:50:00,650 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:50:00,665 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_b188a040-112e-4d5f-8b44-5b20295a249d/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-22 01:50:00,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:50:00,761 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:50:00,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00 WrapperNode [2022-11-22 01:50:00,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:50:00,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:50:00,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:50:00,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:50:00,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,813 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-22 01:50:00,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:50:00,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:50:00,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:50:00,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:50:00,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,840 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:50:00,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:50:00,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:50:00,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:50:00,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (1/1) ... [2022-11-22 01:50:00,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:50:00,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:00,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:50:00,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:50:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:50:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 01:50:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:50:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:50:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:50:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 01:50:00,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 01:50:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 01:50:00,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 01:50:00,937 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 01:50:00,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 01:50:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:50:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 01:50:00,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:50:00,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:50:00,940 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:50:01,107 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:50:01,110 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:50:01,481 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:50:01,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:50:01,634 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:50:01,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:01 BoogieIcfgContainer [2022-11-22 01:50:01,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:50:01,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:50:01,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:50:01,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:50:01,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:50:00" (1/3) ... [2022-11-22 01:50:01,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f73e9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:50:01, skipping insertion in model container [2022-11-22 01:50:01,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:00" (2/3) ... [2022-11-22 01:50:01,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f73e9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:50:01, skipping insertion in model container [2022-11-22 01:50:01,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:01" (3/3) ... [2022-11-22 01:50:01,658 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:50:01,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:50:01,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-22 01:50:01,705 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:50:01,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:50:01,813 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:50:01,827 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 261 flow [2022-11-22 01:50:01,830 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 261 flow [2022-11-22 01:50:01,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-11-22 01:50:01,884 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-11-22 01:50:01,884 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:50:01,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-22 01:50:01,892 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-22 01:50:08,273 INFO L134 LiptonReduction]: Checked pairs total: 5549 [2022-11-22 01:50:08,274 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-22 01:50:08,286 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 83 flow [2022-11-22 01:50:08,393 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:08,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:50:08,422 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;@7786b638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:50:08,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-22 01:50:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:50:08,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:08,432 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:50:08,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash 516, now seen corresponding path program 1 times [2022-11-22 01:50:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219458151] [2022-11-22 01:50:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:08,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:08,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219458151] [2022-11-22 01:50:08,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219458151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:08,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:08,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:50:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303128705] [2022-11-22 01:50:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:08,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:50:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:08,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:50:08,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:50:08,604 INFO L87 Difference]: Start difference. First operand has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 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-22 01:50:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:08,718 INFO L93 Difference]: Finished difference Result 810 states and 2556 transitions. [2022-11-22 01:50:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:50:08,725 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-22 01:50:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:08,745 INFO L225 Difference]: With dead ends: 810 [2022-11-22 01:50:08,745 INFO L226 Difference]: Without dead ends: 810 [2022-11-22 01:50:08,746 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-22 01:50:08,749 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:08,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-22 01:50:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2022-11-22 01:50:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 805 states have (on average 3.1751552795031057) internal successors, (2556), 809 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2556 transitions. [2022-11-22 01:50:08,877 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2556 transitions. Word has length 1 [2022-11-22 01:50:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:08,878 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 2556 transitions. [2022-11-22 01:50:08,878 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-22 01:50:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2556 transitions. [2022-11-22 01:50:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:50:08,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:08,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:08,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:50:08,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1674590762, now seen corresponding path program 1 times [2022-11-22 01:50:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:08,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016720826] [2022-11-22 01:50:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:09,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:09,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016720826] [2022-11-22 01:50:09,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016720826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:09,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:09,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:50:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552748734] [2022-11-22 01:50:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:09,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:09,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:09,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:09,325 INFO L87 Difference]: Start difference. First operand 810 states and 2556 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 01:50:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:09,444 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2022-11-22 01:50:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 01:50:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:09,451 INFO L225 Difference]: With dead ends: 670 [2022-11-22 01:50:09,454 INFO L226 Difference]: Without dead ends: 650 [2022-11-22 01:50:09,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:09,458 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:09,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-22 01:50:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-22 01:50:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-22 01:50:09,497 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2022-11-22 01:50:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:09,499 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-22 01:50:09,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 01:50:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-22 01:50:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:50:09,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:09,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:09,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:50:09,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1331096928, now seen corresponding path program 1 times [2022-11-22 01:50:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:09,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645666624] [2022-11-22 01:50:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:10,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:10,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645666624] [2022-11-22 01:50:10,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645666624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:10,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:10,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:50:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503357212] [2022-11-22 01:50:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:10,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:10,533 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:10,751 INFO L93 Difference]: Finished difference Result 1008 states and 3018 transitions. [2022-11-22 01:50:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:50:10,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:50:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:10,760 INFO L225 Difference]: With dead ends: 1008 [2022-11-22 01:50:10,760 INFO L226 Difference]: Without dead ends: 1008 [2022-11-22 01:50:10,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-22 01:50:10,765 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:10,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:50:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-11-22 01:50:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 690. [2022-11-22 01:50:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 688 states have (on average 3.120639534883721) internal successors, (2147), 689 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2147 transitions. [2022-11-22 01:50:10,806 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 2147 transitions. Word has length 9 [2022-11-22 01:50:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:10,809 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 2147 transitions. [2022-11-22 01:50:10,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 2147 transitions. [2022-11-22 01:50:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:50:10,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:10,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:10,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:50:10,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1687766638, now seen corresponding path program 1 times [2022-11-22 01:50:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:10,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406396781] [2022-11-22 01:50:10,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:10,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:11,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:11,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406396781] [2022-11-22 01:50:11,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406396781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:11,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:11,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:50:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290466325] [2022-11-22 01:50:11,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:11,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:11,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:11,092 INFO L87 Difference]: Start difference. First operand 690 states and 2147 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:11,176 INFO L93 Difference]: Finished difference Result 682 states and 2117 transitions. [2022-11-22 01:50:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-22 01:50:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:11,181 INFO L225 Difference]: With dead ends: 682 [2022-11-22 01:50:11,181 INFO L226 Difference]: Without dead ends: 682 [2022-11-22 01:50:11,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:11,187 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:11,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-11-22 01:50:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-11-22 01:50:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 680 states have (on average 3.113235294117647) internal successors, (2117), 681 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2117 transitions. [2022-11-22 01:50:11,217 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2117 transitions. Word has length 10 [2022-11-22 01:50:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:11,219 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 2117 transitions. [2022-11-22 01:50:11,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2117 transitions. [2022-11-22 01:50:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:50:11,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:11,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:11,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:50:11,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1685667402, now seen corresponding path program 1 times [2022-11-22 01:50:11,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:11,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662117738] [2022-11-22 01:50:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:11,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:11,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662117738] [2022-11-22 01:50:11,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662117738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:11,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:11,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320423902] [2022-11-22 01:50:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:50:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:50:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:11,717 INFO L87 Difference]: Start difference. First operand 682 states and 2117 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:11,904 INFO L93 Difference]: Finished difference Result 582 states and 1782 transitions. [2022-11-22 01:50:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:50:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-22 01:50:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:11,908 INFO L225 Difference]: With dead ends: 582 [2022-11-22 01:50:11,908 INFO L226 Difference]: Without dead ends: 474 [2022-11-22 01:50:11,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:11,909 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:11,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:50:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-22 01:50:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-11-22 01:50:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.923890063424947) internal successors, (1383), 473 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1383 transitions. [2022-11-22 01:50:11,928 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1383 transitions. Word has length 10 [2022-11-22 01:50:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:11,928 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 1383 transitions. [2022-11-22 01:50:11,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1383 transitions. [2022-11-22 01:50:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:50:11,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:11,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:11,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:50:11,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -782660852, now seen corresponding path program 1 times [2022-11-22 01:50:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:11,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362129981] [2022-11-22 01:50:11,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:12,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:12,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362129981] [2022-11-22 01:50:12,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362129981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:12,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200381275] [2022-11-22 01:50:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:12,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:12,914 INFO L87 Difference]: Start difference. First operand 474 states and 1383 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:13,022 INFO L93 Difference]: Finished difference Result 498 states and 1447 transitions. [2022-11-22 01:50:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:50:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:13,028 INFO L225 Difference]: With dead ends: 498 [2022-11-22 01:50:13,028 INFO L226 Difference]: Without dead ends: 498 [2022-11-22 01:50:13,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:13,029 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:13,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-11-22 01:50:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2022-11-22 01:50:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.9164969450101834) internal successors, (1432), 491 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1432 transitions. [2022-11-22 01:50:13,052 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1432 transitions. Word has length 11 [2022-11-22 01:50:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:13,052 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1432 transitions. [2022-11-22 01:50:13,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1432 transitions. [2022-11-22 01:50:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:50:13,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:13,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:13,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:50:13,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -765620400, now seen corresponding path program 1 times [2022-11-22 01:50:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626020051] [2022-11-22 01:50:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:13,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:13,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626020051] [2022-11-22 01:50:13,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626020051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:13,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:13,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:13,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934396549] [2022-11-22 01:50:13,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:13,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:13,400 INFO L87 Difference]: Start difference. First operand 492 states and 1432 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:13,499 INFO L93 Difference]: Finished difference Result 482 states and 1396 transitions. [2022-11-22 01:50:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:50:13,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:13,503 INFO L225 Difference]: With dead ends: 482 [2022-11-22 01:50:13,503 INFO L226 Difference]: Without dead ends: 482 [2022-11-22 01:50:13,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-22 01:50:13,504 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:13,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-22 01:50:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2022-11-22 01:50:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.9129511677282376) internal successors, (1372), 471 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1372 transitions. [2022-11-22 01:50:13,521 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1372 transitions. Word has length 11 [2022-11-22 01:50:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:13,522 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1372 transitions. [2022-11-22 01:50:13,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1372 transitions. [2022-11-22 01:50:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 01:50:13,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:13,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:13,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:50:13,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -762690032, now seen corresponding path program 2 times [2022-11-22 01:50:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419690013] [2022-11-22 01:50:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:14,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:14,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419690013] [2022-11-22 01:50:14,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419690013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:14,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:14,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524938478] [2022-11-22 01:50:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:14,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:14,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:14,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:14,028 INFO L87 Difference]: Start difference. First operand 472 states and 1372 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:14,114 INFO L93 Difference]: Finished difference Result 460 states and 1328 transitions. [2022-11-22 01:50:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:50:14,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:14,118 INFO L225 Difference]: With dead ends: 460 [2022-11-22 01:50:14,119 INFO L226 Difference]: Without dead ends: 460 [2022-11-22 01:50:14,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:14,120 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:14,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-11-22 01:50:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 438. [2022-11-22 01:50:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.9038901601830664) internal successors, (1269), 437 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1269 transitions. [2022-11-22 01:50:14,139 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1269 transitions. Word has length 11 [2022-11-22 01:50:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:14,139 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 1269 transitions. [2022-11-22 01:50:14,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-22 01:50:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1269 transitions. [2022-11-22 01:50:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:50:14,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:14,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:14,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:50:14,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:14,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1504384770, now seen corresponding path program 1 times [2022-11-22 01:50:14,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:14,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968203221] [2022-11-22 01:50:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:14,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:14,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968203221] [2022-11-22 01:50:14,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968203221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:14,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:14,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295958886] [2022-11-22 01:50:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:14,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:50:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:14,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:50:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:14,641 INFO L87 Difference]: Start difference. First operand 438 states and 1269 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:14,799 INFO L93 Difference]: Finished difference Result 522 states and 1491 transitions. [2022-11-22 01:50:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:50:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-22 01:50:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:14,803 INFO L225 Difference]: With dead ends: 522 [2022-11-22 01:50:14,804 INFO L226 Difference]: Without dead ends: 522 [2022-11-22 01:50:14,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 01:50:14,806 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:14,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 14 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-22 01:50:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 486. [2022-11-22 01:50:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.91340206185567) internal successors, (1413), 485 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1413 transitions. [2022-11-22 01:50:14,829 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1413 transitions. Word has length 12 [2022-11-22 01:50:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:14,830 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1413 transitions. [2022-11-22 01:50:14,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1413 transitions. [2022-11-22 01:50:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:50:14,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:14,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:14,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:50:14,832 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -611615189, now seen corresponding path program 1 times [2022-11-22 01:50:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129931696] [2022-11-22 01:50:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:15,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:15,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129931696] [2022-11-22 01:50:15,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129931696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:15,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:15,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:50:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712013734] [2022-11-22 01:50:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:16,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:50:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:50:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:50:16,002 INFO L87 Difference]: Start difference. First operand 486 states and 1413 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:16,317 INFO L93 Difference]: Finished difference Result 838 states and 2314 transitions. [2022-11-22 01:50:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:50:16,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:50:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:16,322 INFO L225 Difference]: With dead ends: 838 [2022-11-22 01:50:16,323 INFO L226 Difference]: Without dead ends: 710 [2022-11-22 01:50:16,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:50:16,323 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:16,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:50:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-22 01:50:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 502. [2022-11-22 01:50:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 2.852295409181637) internal successors, (1429), 501 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1429 transitions. [2022-11-22 01:50:16,344 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1429 transitions. Word has length 13 [2022-11-22 01:50:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:16,344 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 1429 transitions. [2022-11-22 01:50:16,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1429 transitions. [2022-11-22 01:50:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 01:50:16,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:16,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:16,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:50:16,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:16,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -517893013, now seen corresponding path program 1 times [2022-11-22 01:50:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:16,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539323785] [2022-11-22 01:50:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:16,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:16,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539323785] [2022-11-22 01:50:16,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539323785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:16,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:16,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851029863] [2022-11-22 01:50:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:16,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:16,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:16,510 INFO L87 Difference]: Start difference. First operand 502 states and 1429 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:16,610 INFO L93 Difference]: Finished difference Result 477 states and 1193 transitions. [2022-11-22 01:50:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:50:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 01:50:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:16,613 INFO L225 Difference]: With dead ends: 477 [2022-11-22 01:50:16,613 INFO L226 Difference]: Without dead ends: 349 [2022-11-22 01:50:16,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:16,614 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:16,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-22 01:50:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-11-22 01:50:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.4339080459770117) internal successors, (847), 348 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 847 transitions. [2022-11-22 01:50:16,627 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 847 transitions. Word has length 13 [2022-11-22 01:50:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:16,627 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 847 transitions. [2022-11-22 01:50:16,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 847 transitions. [2022-11-22 01:50:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:50:16,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:16,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:16,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 01:50:16,629 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1544001912, now seen corresponding path program 1 times [2022-11-22 01:50:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:16,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698173969] [2022-11-22 01:50:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:16,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:16,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698173969] [2022-11-22 01:50:16,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698173969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:16,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:16,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:16,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046344061] [2022-11-22 01:50:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:16,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:16,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:16,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:16,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:16,854 INFO L87 Difference]: Start difference. First operand 349 states and 847 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-22 01:50:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:16,987 INFO L93 Difference]: Finished difference Result 285 states and 636 transitions. [2022-11-22 01:50:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:50:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-22 01:50:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:16,989 INFO L225 Difference]: With dead ends: 285 [2022-11-22 01:50:16,989 INFO L226 Difference]: Without dead ends: 214 [2022-11-22 01:50:16,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:16,990 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:16,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-22 01:50:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2022-11-22 01:50:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.1739130434782608) internal successors, (450), 207 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 450 transitions. [2022-11-22 01:50:16,997 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 450 transitions. Word has length 14 [2022-11-22 01:50:16,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:16,997 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 450 transitions. [2022-11-22 01:50:16,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-22 01:50:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 450 transitions. [2022-11-22 01:50:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:50:16,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:16,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:16,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 01:50:16,999 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:16,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:16,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1218399871, now seen corresponding path program 1 times [2022-11-22 01:50:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:17,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457753405] [2022-11-22 01:50:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:17,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:17,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457753405] [2022-11-22 01:50:17,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457753405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:17,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:17,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694067888] [2022-11-22 01:50:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:17,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:17,160 INFO L87 Difference]: Start difference. First operand 208 states and 450 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-22 01:50:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:17,246 INFO L93 Difference]: Finished difference Result 274 states and 568 transitions. [2022-11-22 01:50:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:50:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-22 01:50:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:17,248 INFO L225 Difference]: With dead ends: 274 [2022-11-22 01:50:17,248 INFO L226 Difference]: Without dead ends: 118 [2022-11-22 01:50:17,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:17,249 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:17,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-22 01:50:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-11-22 01:50:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.8421052631578947) internal successors, (210), 114 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 210 transitions. [2022-11-22 01:50:17,253 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 210 transitions. Word has length 16 [2022-11-22 01:50:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:17,253 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 210 transitions. [2022-11-22 01:50:17,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-22 01:50:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 210 transitions. [2022-11-22 01:50:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:50:17,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:17,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:17,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 01:50:17,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1306157105, now seen corresponding path program 2 times [2022-11-22 01:50:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:17,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617849457] [2022-11-22 01:50:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:17,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:17,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617849457] [2022-11-22 01:50:17,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617849457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:17,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:17,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:50:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506397401] [2022-11-22 01:50:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:17,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:17,400 INFO L87 Difference]: Start difference. First operand 115 states and 210 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-22 01:50:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:17,452 INFO L93 Difference]: Finished difference Result 154 states and 275 transitions. [2022-11-22 01:50:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-22 01:50:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:17,454 INFO L225 Difference]: With dead ends: 154 [2022-11-22 01:50:17,454 INFO L226 Difference]: Without dead ends: 116 [2022-11-22 01:50:17,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:17,455 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:17,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:50:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-22 01:50:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2022-11-22 01:50:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.794392523364486) internal successors, (192), 107 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 192 transitions. [2022-11-22 01:50:17,460 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 192 transitions. Word has length 16 [2022-11-22 01:50:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:17,460 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 192 transitions. [2022-11-22 01:50:17,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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-22 01:50:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 192 transitions. [2022-11-22 01:50:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:50:17,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:17,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:17,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 01:50:17,462 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash 186324291, now seen corresponding path program 1 times [2022-11-22 01:50:17,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:17,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036258688] [2022-11-22 01:50:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:17,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:50:17,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036258688] [2022-11-22 01:50:17,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036258688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:17,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:17,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:50:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838858156] [2022-11-22 01:50:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:17,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:50:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:50:17,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:50:17,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:17,683 INFO L87 Difference]: Start difference. First operand 108 states and 192 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:17,788 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2022-11-22 01:50:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:50:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 01:50:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:17,790 INFO L225 Difference]: With dead ends: 93 [2022-11-22 01:50:17,790 INFO L226 Difference]: Without dead ends: 35 [2022-11-22 01:50:17,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:50:17,791 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:17,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-22 01:50:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-22 01:50:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-11-22 01:50:17,793 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2022-11-22 01:50:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:17,793 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-11-22 01:50:17,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-11-22 01:50:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:50:17,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:17,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:17,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 01:50:17,794 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1867274958, now seen corresponding path program 1 times [2022-11-22 01:50:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:50:17,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648552006] [2022-11-22 01:50:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:50:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:50:17,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:50:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:50:17,890 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:50:17,890 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:50:17,892 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-22 01:50:17,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-22 01:50:17,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-22 01:50:17,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-22 01:50:17,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-22 01:50:17,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-22 01:50:17,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-22 01:50:17,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-22 01:50:17,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-22 01:50:17,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-22 01:50:17,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-22 01:50:17,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-22 01:50:17,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-22 01:50:17,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 01:50:17,899 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:17,905 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:50:17,905 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:50:17,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:50:17 BasicIcfg [2022-11-22 01:50:17,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:50:17,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:50:17,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:50:17,978 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:50:17,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:01" (3/4) ... [2022-11-22 01:50:17,982 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 01:50:17,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:50:17,983 INFO L158 Benchmark]: Toolchain (without parser) took 17970.43ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 135.6MB in the beginning and 156.1MB in the end (delta: -20.5MB). Peak memory consumption was 102.5MB. Max. memory is 16.1GB. [2022-11-22 01:50:17,983 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:50:17,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 748.30ms. Allocated memory is still 165.7MB. Free memory was 135.4MB in the beginning and 114.3MB in the end (delta: 21.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-11-22 01:50:17,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.30ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 111.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:50:17,985 INFO L158 Benchmark]: Boogie Preprocessor took 30.71ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:50:17,985 INFO L158 Benchmark]: RCFGBuilder took 796.85ms. Allocated memory is still 165.7MB. Free memory was 109.4MB in the beginning and 130.0MB in the end (delta: -20.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-11-22 01:50:17,986 INFO L158 Benchmark]: TraceAbstraction took 16331.82ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 128.9MB in the beginning and 156.1MB in the end (delta: -27.2MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2022-11-22 01:50:17,986 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 287.3MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:50:17,992 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.29ms. Allocated memory is still 130.0MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 748.30ms. Allocated memory is still 165.7MB. Free memory was 135.4MB in the beginning and 114.3MB in the end (delta: 21.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.30ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 111.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.71ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 796.85ms. Allocated memory is still 165.7MB. Free memory was 109.4MB in the beginning and 130.0MB in the end (delta: -20.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16331.82ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 128.9MB in the beginning and 156.1MB in the end (delta: -27.2MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 287.3MB. Free memory is still 156.1MB. 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: 6.4s, 131 PlacesBefore, 43 PlacesAfterwards, 123 TransitionsBefore, 34 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 5549 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2716, independent: 2552, independent conditional: 0, independent unconditional: 2552, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1499, independent: 1444, independent conditional: 0, independent unconditional: 1444, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1499, independent: 1425, independent conditional: 0, independent unconditional: 1425, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 469, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 429, dependent conditional: 0, dependent unconditional: 429, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2716, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1499, unknown conditional: 0, unknown unconditional: 1499] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 818]: 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: 816]: 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 7 procedures, 149 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 73 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=0, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 617 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-22 01:50:18,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:50:20,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:50:20,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:50:20,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:50:20,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:50:20,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:50:20,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:50:20,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:50:20,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:50:20,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:50:20,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:50:20,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:50:20,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:50:20,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:50:20,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:50:20,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:50:20,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:50:20,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:50:20,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:50:20,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:50:20,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:50:20,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:50:20,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:50:20,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:50:20,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:50:20,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:50:20,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:50:20,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:50:20,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:50:20,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:50:20,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:50:20,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:50:20,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:50:20,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:50:20,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:50:20,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:50:20,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:50:20,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:50:20,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:50:20,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:50:20,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:50:20,630 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 01:50:20,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:50:20,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:50:20,682 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:50:20,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:50:20,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:50:20,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:50:20,684 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:50:20,685 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:50:20,685 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:50:20,685 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:50:20,686 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:50:20,687 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:50:20,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 01:50:20,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 01:50:20,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:50:20,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:50:20,689 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:50:20,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:50:20,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:50:20,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:50:20,690 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 01:50:20,690 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 01:50:20,690 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 01:50:20,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:50:20,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:50:20,691 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 01:50:20,691 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 01:50:20,692 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:50:20,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:50:20,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:50:20,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 01:50:20,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:50:20,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:50:20,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:50:20,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:50:20,694 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 01:50:20,695 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 01:50:20,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:50:20,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 01:50:20,695 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_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2022-11-22 01:50:21,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:50:21,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:50:21,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:50:21,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:50:21,078 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:50:21,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:50:24,274 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:50:24,570 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:50:24,579 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:50:24,602 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data/ef0700629/eb6afcc9f2144680baa259441c7e7d19/FLAGd091031cb [2022-11-22 01:50:24,616 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/data/ef0700629/eb6afcc9f2144680baa259441c7e7d19 [2022-11-22 01:50:24,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:50:24,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:50:24,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:50:24,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:50:24,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:50:24,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:24" (1/1) ... [2022-11-22 01:50:24,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0419b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:24, skipping insertion in model container [2022-11-22 01:50:24,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:50:24" (1/1) ... [2022-11-22 01:50:24,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:50:24,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:50:24,878 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_b188a040-112e-4d5f-8b44-5b20295a249d/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-22 01:50:25,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:50:25,186 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:50:25,204 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_b188a040-112e-4d5f-8b44-5b20295a249d/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-22 01:50:25,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:50:25,404 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:50:25,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25 WrapperNode [2022-11-22 01:50:25,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:50:25,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:50:25,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:50:25,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:50:25,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,495 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-22 01:50:25,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:50:25,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:50:25,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:50:25,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:50:25,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:50:25,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:50:25,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:50:25,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:50:25,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (1/1) ... [2022-11-22 01:50:25,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:50:25,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:50:25,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:50:25,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:50:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 01:50:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:50:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 01:50:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:50:25,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 01:50:25,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 01:50:25,605 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 01:50:25,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 01:50:25,605 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 01:50:25,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 01:50:25,605 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 01:50:25,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 01:50:25,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 01:50:25,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:50:25,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:50:25,612 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 01:50:25,758 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:50:25,760 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:50:26,259 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:50:26,457 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:50:26,460 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:50:26,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:26 BoogieIcfgContainer [2022-11-22 01:50:26,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:50:26,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:50:26,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:50:26,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:50:26,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:50:24" (1/3) ... [2022-11-22 01:50:26,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74955fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:50:26, skipping insertion in model container [2022-11-22 01:50:26,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:50:25" (2/3) ... [2022-11-22 01:50:26,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74955fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:50:26, skipping insertion in model container [2022-11-22 01:50:26,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:26" (3/3) ... [2022-11-22 01:50:26,476 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 01:50:26,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:50:26,498 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-22 01:50:26,499 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 01:50:26,578 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 01:50:26,624 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 01:50:26,654 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-22 01:50:26,663 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-22 01:50:26,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-22 01:50:26,744 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-22 01:50:26,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 01:50:26,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-22 01:50:26,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-22 01:50:36,002 INFO L134 LiptonReduction]: Checked pairs total: 5561 [2022-11-22 01:50:36,002 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-11-22 01:50:36,012 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 83 flow [2022-11-22 01:50:36,113 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:36,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:50:36,144 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;@3bf43445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:50:36,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-22 01:50:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 01:50:36,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:36,155 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 01:50:36,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash 521, now seen corresponding path program 1 times [2022-11-22 01:50:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:36,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91915664] [2022-11-22 01:50:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:36,184 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-22 01:50:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:36,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:36,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:36,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 01:50:36,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:36,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:36,342 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91915664] [2022-11-22 01:50:36,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91915664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:36,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:36,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 01:50:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069413366] [2022-11-22 01:50:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:36,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 01:50:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:36,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 01:50:36,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 01:50:36,385 INFO L87 Difference]: Start difference. First operand has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 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-22 01:50:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:36,550 INFO L93 Difference]: Finished difference Result 810 states and 2556 transitions. [2022-11-22 01:50:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 01:50:36,553 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-22 01:50:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:36,577 INFO L225 Difference]: With dead ends: 810 [2022-11-22 01:50:36,577 INFO L226 Difference]: Without dead ends: 810 [2022-11-22 01:50:36,578 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-22 01:50:36,582 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:36,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-22 01:50:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2022-11-22 01:50:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 805 states have (on average 3.1751552795031057) internal successors, (2556), 809 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2556 transitions. [2022-11-22 01:50:36,699 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2556 transitions. Word has length 1 [2022-11-22 01:50:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:36,699 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 2556 transitions. [2022-11-22 01:50:36,699 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-22 01:50:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2556 transitions. [2022-11-22 01:50:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 01:50:36,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:36,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:36,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:36,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:36,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1475645226, now seen corresponding path program 1 times [2022-11-22 01:50:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:36,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345413029] [2022-11-22 01:50:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:36,915 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-22 01:50:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:36,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:36,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:37,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:50:37,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:37,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:37,118 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:37,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345413029] [2022-11-22 01:50:37,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345413029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:37,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:37,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 01:50:37,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361225613] [2022-11-22 01:50:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:37,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:37,122 INFO L87 Difference]: Start difference. First operand 810 states and 2556 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 01:50:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:37,218 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2022-11-22 01:50:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:37,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 01:50:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:37,224 INFO L225 Difference]: With dead ends: 670 [2022-11-22 01:50:37,225 INFO L226 Difference]: Without dead ends: 650 [2022-11-22 01:50:37,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:37,226 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:37,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-22 01:50:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-22 01:50:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-22 01:50:37,260 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2022-11-22 01:50:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:37,261 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-22 01:50:37,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-22 01:50:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-22 01:50:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:50:37,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:37,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:37,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:37,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:37,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash -755766461, now seen corresponding path program 1 times [2022-11-22 01:50:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:37,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280666151] [2022-11-22 01:50:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:37,478 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-22 01:50:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:37,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:37,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:37,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:50:37,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:37,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:37,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280666151] [2022-11-22 01:50:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280666151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:37,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:37,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791863299] [2022-11-22 01:50:37,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:37,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:37,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:37,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:37,717 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:37,906 INFO L93 Difference]: Finished difference Result 510 states and 1351 transitions. [2022-11-22 01:50:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:50:37,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 01:50:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:37,909 INFO L225 Difference]: With dead ends: 510 [2022-11-22 01:50:37,909 INFO L226 Difference]: Without dead ends: 410 [2022-11-22 01:50:37,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:37,911 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:37,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:50:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-22 01:50:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-22 01:50:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 2.6176470588235294) internal successors, (1068), 409 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1068 transitions. [2022-11-22 01:50:37,941 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1068 transitions. Word has length 9 [2022-11-22 01:50:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:37,941 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1068 transitions. [2022-11-22 01:50:37,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1068 transitions. [2022-11-22 01:50:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:50:37,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:37,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:37,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:38,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash -666197350, now seen corresponding path program 1 times [2022-11-22 01:50:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:38,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450592080] [2022-11-22 01:50:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:38,157 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-22 01:50:38,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:38,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:38,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:50:38,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:38,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:38,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:38,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450592080] [2022-11-22 01:50:38,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450592080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:38,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:50:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568329881] [2022-11-22 01:50:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:38,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:50:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:50:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:38,367 INFO L87 Difference]: Start difference. First operand 410 states and 1068 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:38,591 INFO L93 Difference]: Finished difference Result 262 states and 599 transitions. [2022-11-22 01:50:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:50:38,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-22 01:50:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:38,594 INFO L225 Difference]: With dead ends: 262 [2022-11-22 01:50:38,594 INFO L226 Difference]: Without dead ends: 210 [2022-11-22 01:50:38,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:38,595 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:38,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 27 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:50:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-22 01:50:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-22 01:50:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 2.25) internal successors, (468), 209 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 468 transitions. [2022-11-22 01:50:38,606 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 468 transitions. Word has length 12 [2022-11-22 01:50:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:38,607 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 468 transitions. [2022-11-22 01:50:38,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 468 transitions. [2022-11-22 01:50:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 01:50:38,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:38,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:38,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1564855043, now seen corresponding path program 1 times [2022-11-22 01:50:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12122547] [2022-11-22 01:50:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:38,829 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-22 01:50:38,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:38,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:38,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 01:50:38,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:39,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:39,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:39,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12122547] [2022-11-22 01:50:39,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12122547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:39,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:39,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:50:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134727690] [2022-11-22 01:50:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:39,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:50:39,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:50:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:50:39,032 INFO L87 Difference]: Start difference. First operand 210 states and 468 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) 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-22 01:50:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:39,371 INFO L93 Difference]: Finished difference Result 167 states and 380 transitions. [2022-11-22 01:50:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 01:50:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) 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-22 01:50:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:39,373 INFO L225 Difference]: With dead ends: 167 [2022-11-22 01:50:39,373 INFO L226 Difference]: Without dead ends: 155 [2022-11-22 01:50:39,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:50:39,375 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:39,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 45 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:50:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-22 01:50:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-11-22 01:50:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 2.3398692810457518) internal successors, (358), 154 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 358 transitions. [2022-11-22 01:50:39,388 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 358 transitions. Word has length 16 [2022-11-22 01:50:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:39,389 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 358 transitions. [2022-11-22 01:50:39,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) 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-22 01:50:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 358 transitions. [2022-11-22 01:50:39,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:50:39,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:39,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:39,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:39,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:39,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2045072028, now seen corresponding path program 1 times [2022-11-22 01:50:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:39,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953748675] [2022-11-22 01:50:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:50:39,614 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-22 01:50:39,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:39,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:39,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:50:39,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:50:39,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:39,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:39,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:39,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953748675] [2022-11-22 01:50:39,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953748675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:39,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:39,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:50:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484991299] [2022-11-22 01:50:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:39,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:50:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:50:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:50:39,856 INFO L87 Difference]: Start difference. First operand 155 states and 358 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-22 01:50:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:40,003 INFO L93 Difference]: Finished difference Result 204 states and 458 transitions. [2022-11-22 01:50:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:50:40,005 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-22 01:50:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:40,006 INFO L225 Difference]: With dead ends: 204 [2022-11-22 01:50:40,006 INFO L226 Difference]: Without dead ends: 204 [2022-11-22 01:50:40,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:50:40,008 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:40,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-22 01:50:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-11-22 01:50:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.285) internal successors, (457), 201 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 457 transitions. [2022-11-22 01:50:40,022 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 457 transitions. Word has length 20 [2022-11-22 01:50:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:40,022 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 457 transitions. [2022-11-22 01:50:40,023 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-22 01:50:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 457 transitions. [2022-11-22 01:50:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:50:40,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:40,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:40,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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)] Forceful destruction successful, exit code 0 [2022-11-22 01:50:40,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -856991522, now seen corresponding path program 2 times [2022-11-22 01:50:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:40,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759487067] [2022-11-22 01:50:40,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 01:50:40,241 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-22 01:50:40,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:40,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 01:50:40,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:50:40,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 01:50:40,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:50:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:50:40,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:50:40,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:50:40,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759487067] [2022-11-22 01:50:40,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759487067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:50:40,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:50:40,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:50:40,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058165855] [2022-11-22 01:50:40,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:50:40,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:50:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:50:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:50:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:40,451 INFO L87 Difference]: Start difference. First operand 202 states and 457 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-22 01:50:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:50:40,556 INFO L93 Difference]: Finished difference Result 288 states and 628 transitions. [2022-11-22 01:50:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:50:40,557 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-22 01:50:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:50:40,558 INFO L225 Difference]: With dead ends: 288 [2022-11-22 01:50:40,559 INFO L226 Difference]: Without dead ends: 288 [2022-11-22 01:50:40,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:50:40,560 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:50:40,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:50:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-22 01:50:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 190. [2022-11-22 01:50:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 2.276595744680851) internal successors, (428), 189 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:50:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 428 transitions. [2022-11-22 01:50:40,568 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 428 transitions. Word has length 20 [2022-11-22 01:50:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:50:40,568 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 428 transitions. [2022-11-22 01:50:40,569 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-22 01:50:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 428 transitions. [2022-11-22 01:50:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:50:40,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:50:40,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:50:40,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-22 01:50:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:50:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1848556672, now seen corresponding path program 3 times [2022-11-22 01:50:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:50:40,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907006734] [2022-11-22 01:50:40,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:50:40,785 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-22 01:50:40,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:50:40,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:40,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 01:50:40,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-22 01:50:40,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:50:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:50:41,103 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 01:50:41,103 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:50:41,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-22 01:50:41,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-22 01:50:41,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-22 01:50:41,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-22 01:50:41,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-22 01:50:41,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-22 01:50:41,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-22 01:50:41,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-22 01:50:41,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-22 01:50:41,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-22 01:50:41,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-22 01:50:41,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-22 01:50:41,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-22 01:50:41,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:41,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/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-22 01:50:41,327 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-11-22 01:50:41,333 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 01:50:41,334 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:50:41,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:50:41 BasicIcfg [2022-11-22 01:50:41,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:50:41,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:50:41,442 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:50:41,442 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:50:41,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:50:26" (3/4) ... [2022-11-22 01:50:41,445 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 01:50:41,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:50:41,446 INFO L158 Benchmark]: Toolchain (without parser) took 16826.22ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 71.6MB in the beginning and 97.9MB in the end (delta: -26.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-11-22 01:50:41,446 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 65.0MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:50:41,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 782.25ms. Allocated memory is still 94.4MB. Free memory was 71.6MB in the beginning and 69.7MB in the end (delta: 1.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-22 01:50:41,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.46ms. Allocated memory is still 94.4MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:50:41,447 INFO L158 Benchmark]: Boogie Preprocessor took 31.88ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:50:41,448 INFO L158 Benchmark]: RCFGBuilder took 934.18ms. Allocated memory is still 94.4MB. Free memory was 64.8MB in the beginning and 60.4MB in the end (delta: 4.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-11-22 01:50:41,448 INFO L158 Benchmark]: TraceAbstraction took 14975.58ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 59.4MB in the beginning and 97.9MB in the end (delta: -38.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-11-22 01:50:41,449 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 136.3MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:50:41,452 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.33ms. Allocated memory is still 65.0MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 782.25ms. Allocated memory is still 94.4MB. Free memory was 71.6MB in the beginning and 69.7MB in the end (delta: 1.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.46ms. Allocated memory is still 94.4MB. Free memory was 69.7MB in the beginning and 66.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.88ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 934.18ms. Allocated memory is still 94.4MB. Free memory was 64.8MB in the beginning and 60.4MB in the end (delta: 4.4MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14975.58ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 59.4MB in the beginning and 97.9MB in the end (delta: -38.4MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 136.3MB. Free memory is still 97.9MB. 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: 9.3s, 132 PlacesBefore, 43 PlacesAfterwards, 124 TransitionsBefore, 34 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 5561 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2798, independent: 2634, independent conditional: 0, independent unconditional: 2634, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1514, independent: 1459, independent conditional: 0, independent unconditional: 1459, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1514, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 478, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 407, dependent conditional: 0, dependent unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2798, independent: 1175, independent conditional: 0, independent unconditional: 1175, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1514, unknown conditional: 0, unknown unconditional: 1514] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=536936448, t1492={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=536936449, t1492={-6:0}, t1493={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=536936450, t1492={-6:0}, t1493={-10:0}, t1494={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={-6:0}, t1493={-10:0}, t1494={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 818]: 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: 816]: 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 7 procedures, 150 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 44 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 100 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 13 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-22 01:50:41,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b188a040-112e-4d5f-8b44-5b20295a249d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample