./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS --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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- 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-8393723 [2022-11-19 07:35:26,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:35:26,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:35:26,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:35:26,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:35:26,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:35:26,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:35:26,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:35:26,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:35:26,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:35:26,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:35:26,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:35:26,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:35:26,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:35:26,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:35:26,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:35:26,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:35:26,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:35:26,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:35:26,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:35:26,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:35:26,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:35:26,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:35:26,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:35:26,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:35:26,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:35:26,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:35:26,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:35:26,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:35:26,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:35:26,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:35:26,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:35:26,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:35:26,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:35:26,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:35:26,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:35:26,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:35:26,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:35:26,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:35:26,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:35:26,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:35:26,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:35:26,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:35:26,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:35:26,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:35:26,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:35:26,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:35:26,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:35:26,398 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:35:26,398 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:35:26,398 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:35:26,398 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:35:26,399 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:35:26,399 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:35:26,399 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:35:26,400 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:35:26,400 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:35:26,400 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:35:26,400 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:35:26,401 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:35:26,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:35:26,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:35:26,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:35:26,402 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:35:26,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:35:26,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:35:26,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:35:26,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:35:26,404 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:35:26,404 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:35:26,404 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:35:26,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:35:26,405 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:35:26,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:35:26,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:35:26,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:35:26,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:35:26,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:35:26,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:35:26,407 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:35:26,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:35:26,407 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:35:26,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:35:26,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:35:26,408 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_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2022-11-19 07:35:26,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:35:26,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:35:26,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:35:26,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:35:26,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:35:26,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-19 07:35:26,885 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/3e33a20d9/f4104ef3dc724225bd0664a18b17dc6a/FLAGc4505ec41 [2022-11-19 07:35:27,656 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:35:27,657 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-19 07:35:27,675 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/3e33a20d9/f4104ef3dc724225bd0664a18b17dc6a/FLAGc4505ec41 [2022-11-19 07:35:27,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/3e33a20d9/f4104ef3dc724225bd0664a18b17dc6a [2022-11-19 07:35:27,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:35:27,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:35:27,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:35:27,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:35:27,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:35:27,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:27" (1/1) ... [2022-11-19 07:35:27,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cdbda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:27, skipping insertion in model container [2022-11-19 07:35:27,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:27" (1/1) ... [2022-11-19 07:35:27,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:35:27,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:35:28,164 WARN L234 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_59a8264a-e9b4-4397-9c58-53847414ea34/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-19 07:35:28,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:35:28,404 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:35:28,418 WARN L234 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_59a8264a-e9b4-4397-9c58-53847414ea34/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-19 07:35:28,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:35:28,524 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:35:28,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28 WrapperNode [2022-11-19 07:35:28,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:35:28,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:35:28,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:35:28,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:35:28,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,626 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-19 07:35:28,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:35:28,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:35:28,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:35:28,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:35:28,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,682 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:35:28,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:35:28,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:35:28,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:35:28,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (1/1) ... [2022-11-19 07:35:28,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:35:28,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:35:28,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:35:28,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:35:28,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:35:28,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:35:28,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:35:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:35:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:35:28,797 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:35:28,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:35:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:35:28,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:35:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:35:28,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:35:28,798 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:35:28,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:35:28,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:35:28,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:35:28,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:35:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:35:28,801 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:35:29,069 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:35:29,072 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:35:29,636 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:35:29,858 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:35:29,863 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:35:29,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:29 BoogieIcfgContainer [2022-11-19 07:35:29,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:35:29,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:35:29,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:35:29,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:35:29,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:27" (1/3) ... [2022-11-19 07:35:29,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9de499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:29, skipping insertion in model container [2022-11-19 07:35:29,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:28" (2/3) ... [2022-11-19 07:35:29,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9de499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:29, skipping insertion in model container [2022-11-19 07:35:29,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:29" (3/3) ... [2022-11-19 07:35:29,886 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-11-19 07:35:29,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:35:29,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-19 07:35:29,910 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:35:29,985 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:35:30,052 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:35:30,073 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-19 07:35:30,076 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-19 07:35:30,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-19 07:35:30,154 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-19 07:35:30,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:35:30,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-19 07:35:30,166 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490 [2022-11-19 07:35:37,870 INFO L134 LiptonReduction]: Checked pairs total: 8851 [2022-11-19 07:35:37,872 INFO L136 LiptonReduction]: Total number of compositions: 147 [2022-11-19 07:35:37,892 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 43 transitions, 106 flow [2022-11-19 07:35:38,169 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 0 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-19 07:35:38,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:35:38,200 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;@159e9636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:35:38,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-19 07:35:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 0 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-19 07:35:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:35:38,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:38,225 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:35:38,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2022-11-19 07:35:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:38,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994594397] [2022-11-19 07:35:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:38,393 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-19 07:35:38,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:38,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994594397] [2022-11-19 07:35:38,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994594397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:38,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:38,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:35:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228251955] [2022-11-19 07:35:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:38,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:35:38,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:35:38,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:35:38,448 INFO L87 Difference]: Start difference. First operand has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 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-19 07:35:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:38,709 INFO L93 Difference]: Finished difference Result 3722 states and 14640 transitions. [2022-11-19 07:35:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:35:38,719 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-19 07:35:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:38,778 INFO L225 Difference]: With dead ends: 3722 [2022-11-19 07:35:38,779 INFO L226 Difference]: Without dead ends: 3722 [2022-11-19 07:35:38,780 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-19 07:35:38,784 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:38,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-11-19 07:35:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3722. [2022-11-19 07:35:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3717 states have (on average 3.9386602098466503) internal successors, (14640), 3721 states have internal predecessors, (14640), 0 states have call successors, (0), 0 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-19 07:35:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 14640 transitions. [2022-11-19 07:35:39,086 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 14640 transitions. Word has length 1 [2022-11-19 07:35:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:39,086 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 14640 transitions. [2022-11-19 07:35:39,087 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-19 07:35:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 14640 transitions. [2022-11-19 07:35:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:35:39,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:39,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:39,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:35:39,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1736068936, now seen corresponding path program 1 times [2022-11-19 07:35:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:39,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878261754] [2022-11-19 07:35:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:39,631 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-19 07:35:39,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878261754] [2022-11-19 07:35:39,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878261754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:39,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:39,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:35:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443315050] [2022-11-19 07:35:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:39,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:35:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:35:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:35:39,637 INFO L87 Difference]: Start difference. First operand 3722 states and 14640 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 07:35:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:39,790 INFO L93 Difference]: Finished difference Result 3162 states and 12312 transitions. [2022-11-19 07:35:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:35:39,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 07:35:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:39,825 INFO L225 Difference]: With dead ends: 3162 [2022-11-19 07:35:39,825 INFO L226 Difference]: Without dead ends: 3082 [2022-11-19 07:35:39,826 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-19 07:35:39,827 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:39,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2022-11-19 07:35:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2022-11-19 07:35:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3080 states have (on average 3.911688311688312) internal successors, (12048), 3081 states have internal predecessors, (12048), 0 states have call successors, (0), 0 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-19 07:35:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 12048 transitions. [2022-11-19 07:35:39,995 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 12048 transitions. Word has length 9 [2022-11-19 07:35:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:39,997 INFO L495 AbstractCegarLoop]: Abstraction has 3082 states and 12048 transitions. [2022-11-19 07:35:39,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 07:35:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 12048 transitions. [2022-11-19 07:35:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:35:40,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:40,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:40,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:35:40,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 769033550, now seen corresponding path program 1 times [2022-11-19 07:35:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232089732] [2022-11-19 07:35:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:40,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:41,338 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-19 07:35:41,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232089732] [2022-11-19 07:35:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232089732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:41,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:41,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:35:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408572924] [2022-11-19 07:35:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:41,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:35:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:35:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:35:41,342 INFO L87 Difference]: Start difference. First operand 3082 states and 12048 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-19 07:35:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:41,990 INFO L93 Difference]: Finished difference Result 5658 states and 21180 transitions. [2022-11-19 07:35:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:35:41,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-19 07:35:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:42,042 INFO L225 Difference]: With dead ends: 5658 [2022-11-19 07:35:42,043 INFO L226 Difference]: Without dead ends: 5658 [2022-11-19 07:35:42,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:35:42,044 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:42,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 17 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:35:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2022-11-19 07:35:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 3682. [2022-11-19 07:35:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3680 states have (on average 3.9152173913043478) internal successors, (14408), 3681 states have internal predecessors, (14408), 0 states have call successors, (0), 0 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-19 07:35:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 14408 transitions. [2022-11-19 07:35:42,259 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 14408 transitions. Word has length 12 [2022-11-19 07:35:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:42,262 INFO L495 AbstractCegarLoop]: Abstraction has 3682 states and 14408 transitions. [2022-11-19 07:35:42,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-19 07:35:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 14408 transitions. [2022-11-19 07:35:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:35:42,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:42,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:42,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:35:42,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 769033598, now seen corresponding path program 1 times [2022-11-19 07:35:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:42,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799807183] [2022-11-19 07:35:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:43,435 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-19 07:35:43,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799807183] [2022-11-19 07:35:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799807183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:43,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:43,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:35:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679365545] [2022-11-19 07:35:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:43,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:35:43,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:35:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:35:43,438 INFO L87 Difference]: Start difference. First operand 3682 states and 14408 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-19 07:35:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:43,841 INFO L93 Difference]: Finished difference Result 3202 states and 12004 transitions. [2022-11-19 07:35:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:35:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-19 07:35:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:43,880 INFO L225 Difference]: With dead ends: 3202 [2022-11-19 07:35:43,880 INFO L226 Difference]: Without dead ends: 2706 [2022-11-19 07:35:43,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:35:43,886 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:43,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:35:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2022-11-19 07:35:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2706. [2022-11-19 07:35:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 3.756007393715342) internal successors, (10160), 2705 states have internal predecessors, (10160), 0 states have call successors, (0), 0 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-19 07:35:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 10160 transitions. [2022-11-19 07:35:44,029 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 10160 transitions. Word has length 12 [2022-11-19 07:35:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:44,031 INFO L495 AbstractCegarLoop]: Abstraction has 2706 states and 10160 transitions. [2022-11-19 07:35:44,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-19 07:35:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 10160 transitions. [2022-11-19 07:35:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:35:44,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:44,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:44,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:35:44,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 719546144, now seen corresponding path program 1 times [2022-11-19 07:35:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:44,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945225639] [2022-11-19 07:35:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:45,147 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-19 07:35:45,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:45,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945225639] [2022-11-19 07:35:45,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945225639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:45,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:45,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:35:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773101244] [2022-11-19 07:35:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:45,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:35:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:35:45,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:35:45,151 INFO L87 Difference]: Start difference. First operand 2706 states and 10160 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:45,578 INFO L93 Difference]: Finished difference Result 3526 states and 12716 transitions. [2022-11-19 07:35:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:35:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:35:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:45,596 INFO L225 Difference]: With dead ends: 3526 [2022-11-19 07:35:45,597 INFO L226 Difference]: Without dead ends: 2986 [2022-11-19 07:35:45,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:35:45,598 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:45,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 19 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:35:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2022-11-19 07:35:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2346. [2022-11-19 07:35:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 3.7236673773987206) internal successors, (8732), 2345 states have internal predecessors, (8732), 0 states have call successors, (0), 0 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-19 07:35:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8732 transitions. [2022-11-19 07:35:45,704 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8732 transitions. Word has length 13 [2022-11-19 07:35:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:45,704 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 8732 transitions. [2022-11-19 07:35:45,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8732 transitions. [2022-11-19 07:35:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:35:45,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:45,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:45,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:35:45,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash 122114992, now seen corresponding path program 1 times [2022-11-19 07:35:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:45,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622865834] [2022-11-19 07:35:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:45,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:47,121 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-19 07:35:47,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:47,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622865834] [2022-11-19 07:35:47,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622865834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:47,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:47,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:35:47,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692854543] [2022-11-19 07:35:47,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:47,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:35:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:35:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:47,124 INFO L87 Difference]: Start difference. First operand 2346 states and 8732 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-19 07:35:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:47,542 INFO L93 Difference]: Finished difference Result 2754 states and 10093 transitions. [2022-11-19 07:35:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:35:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-19 07:35:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:47,555 INFO L225 Difference]: With dead ends: 2754 [2022-11-19 07:35:47,555 INFO L226 Difference]: Without dead ends: 2450 [2022-11-19 07:35:47,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:35:47,557 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:47,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 26 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:35:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2022-11-19 07:35:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2214. [2022-11-19 07:35:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2213 states have (on average 3.6945323090826934) internal successors, (8176), 2213 states have internal predecessors, (8176), 0 states have call successors, (0), 0 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-19 07:35:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 8176 transitions. [2022-11-19 07:35:47,642 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 8176 transitions. Word has length 15 [2022-11-19 07:35:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:47,642 INFO L495 AbstractCegarLoop]: Abstraction has 2214 states and 8176 transitions. [2022-11-19 07:35:47,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-19 07:35:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 8176 transitions. [2022-11-19 07:35:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:35:47,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:47,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:47,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:35:47,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2023378047, now seen corresponding path program 1 times [2022-11-19 07:35:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:47,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342283046] [2022-11-19 07:35:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:48,402 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-19 07:35:48,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:48,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342283046] [2022-11-19 07:35:48,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342283046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:48,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:48,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:35:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967087754] [2022-11-19 07:35:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:48,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:35:48,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:35:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:35:48,408 INFO L87 Difference]: Start difference. First operand 2214 states and 8176 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-19 07:35:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:48,722 INFO L93 Difference]: Finished difference Result 2898 states and 10496 transitions. [2022-11-19 07:35:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:35:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-19 07:35:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:48,738 INFO L225 Difference]: With dead ends: 2898 [2022-11-19 07:35:48,738 INFO L226 Difference]: Without dead ends: 2646 [2022-11-19 07:35:48,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:35:48,740 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 102 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:48,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 33 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:35:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2022-11-19 07:35:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2498. [2022-11-19 07:35:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2497 states have (on average 3.68442130556668) internal successors, (9200), 2497 states have internal predecessors, (9200), 0 states have call successors, (0), 0 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-19 07:35:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9200 transitions. [2022-11-19 07:35:48,844 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 9200 transitions. Word has length 17 [2022-11-19 07:35:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:48,844 INFO L495 AbstractCegarLoop]: Abstraction has 2498 states and 9200 transitions. [2022-11-19 07:35:48,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-19 07:35:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 9200 transitions. [2022-11-19 07:35:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:35:48,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:48,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:48,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:35:48,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1453983439, now seen corresponding path program 1 times [2022-11-19 07:35:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:48,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471413528] [2022-11-19 07:35:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:49,155 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-19 07:35:49,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:49,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471413528] [2022-11-19 07:35:49,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471413528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:49,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:49,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:35:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972451821] [2022-11-19 07:35:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:49,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:35:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:49,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:35:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:35:49,159 INFO L87 Difference]: Start difference. First operand 2498 states and 9200 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-19 07:35:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:49,247 INFO L93 Difference]: Finished difference Result 1952 states and 6516 transitions. [2022-11-19 07:35:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:35:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-19 07:35:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:49,258 INFO L225 Difference]: With dead ends: 1952 [2022-11-19 07:35:49,258 INFO L226 Difference]: Without dead ends: 1952 [2022-11-19 07:35:49,258 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-19 07:35:49,259 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:49,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-19 07:35:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-11-19 07:35:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1951 states have (on average 3.3398257303946695) internal successors, (6516), 1951 states have internal predecessors, (6516), 0 states have call successors, (0), 0 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-19 07:35:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 6516 transitions. [2022-11-19 07:35:49,329 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 6516 transitions. Word has length 17 [2022-11-19 07:35:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:49,330 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 6516 transitions. [2022-11-19 07:35:49,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-19 07:35:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 6516 transitions. [2022-11-19 07:35:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:35:49,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:49,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:49,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:35:49,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1791616133, now seen corresponding path program 1 times [2022-11-19 07:35:49,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:49,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31632927] [2022-11-19 07:35:49,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:49,590 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-19 07:35:49,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:49,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31632927] [2022-11-19 07:35:49,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31632927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:49,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:49,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:35:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662768131] [2022-11-19 07:35:49,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:35:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:35:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:35:49,594 INFO L87 Difference]: Start difference. First operand 1952 states and 6516 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:49,712 INFO L93 Difference]: Finished difference Result 1220 states and 3651 transitions. [2022-11-19 07:35:49,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:35:49,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:35:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:49,718 INFO L225 Difference]: With dead ends: 1220 [2022-11-19 07:35:49,719 INFO L226 Difference]: Without dead ends: 1220 [2022-11-19 07:35:49,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:35:49,720 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:49,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-11-19 07:35:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220. [2022-11-19 07:35:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1219 states have (on average 2.995077932731747) internal successors, (3651), 1219 states have internal predecessors, (3651), 0 states have call successors, (0), 0 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-19 07:35:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 3651 transitions. [2022-11-19 07:35:49,762 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 3651 transitions. Word has length 18 [2022-11-19 07:35:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:49,763 INFO L495 AbstractCegarLoop]: Abstraction has 1220 states and 3651 transitions. [2022-11-19 07:35:49,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 3651 transitions. [2022-11-19 07:35:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:35:49,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:49,767 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-19 07:35:49,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:35:49,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1435866755, now seen corresponding path program 1 times [2022-11-19 07:35:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:49,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129868621] [2022-11-19 07:35:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:50,839 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-19 07:35:50,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:50,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129868621] [2022-11-19 07:35:50,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129868621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:50,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:50,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:35:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513460957] [2022-11-19 07:35:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:50,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:35:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:35:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:35:50,841 INFO L87 Difference]: Start difference. First operand 1220 states and 3651 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 07:35:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:51,139 INFO L93 Difference]: Finished difference Result 1782 states and 5143 transitions. [2022-11-19 07:35:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:35:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 07:35:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:51,145 INFO L225 Difference]: With dead ends: 1782 [2022-11-19 07:35:51,145 INFO L226 Difference]: Without dead ends: 1234 [2022-11-19 07:35:51,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:51,146 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:51,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:35:51,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-11-19 07:35:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1192. [2022-11-19 07:35:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 2.8597816960537363) internal successors, (3406), 1191 states have internal predecessors, (3406), 0 states have call successors, (0), 0 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-19 07:35:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3406 transitions. [2022-11-19 07:35:51,183 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3406 transitions. Word has length 20 [2022-11-19 07:35:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:51,183 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 3406 transitions. [2022-11-19 07:35:51,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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-19 07:35:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3406 transitions. [2022-11-19 07:35:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:35:51,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:51,187 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-19 07:35:51,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:35:51,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 297047680, now seen corresponding path program 1 times [2022-11-19 07:35:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:51,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482678985] [2022-11-19 07:35:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:51,436 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-19 07:35:51,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:51,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482678985] [2022-11-19 07:35:51,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482678985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:51,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:51,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:35:51,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775993541] [2022-11-19 07:35:51,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:51,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:35:51,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:51,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:35:51,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:35:51,439 INFO L87 Difference]: Start difference. First operand 1192 states and 3406 transitions. Second operand has 5 states, 5 states have (on average 4.0) 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-19 07:35:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:51,592 INFO L93 Difference]: Finished difference Result 876 states and 2488 transitions. [2022-11-19 07:35:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:35:51,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) 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-19 07:35:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:51,596 INFO L225 Difference]: With dead ends: 876 [2022-11-19 07:35:51,596 INFO L226 Difference]: Without dead ends: 876 [2022-11-19 07:35:51,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 07:35:51,597 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:51,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 16 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-11-19 07:35:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 828. [2022-11-19 07:35:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 2.853688029020556) internal successors, (2360), 827 states have internal predecessors, (2360), 0 states have call successors, (0), 0 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-19 07:35:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2360 transitions. [2022-11-19 07:35:51,623 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 2360 transitions. Word has length 20 [2022-11-19 07:35:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:51,624 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 2360 transitions. [2022-11-19 07:35:51,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) 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-19 07:35:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 2360 transitions. [2022-11-19 07:35:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:35:51,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:51,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:51,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:35:51,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1631927898, now seen corresponding path program 1 times [2022-11-19 07:35:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:51,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181603258] [2022-11-19 07:35:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:52,598 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-19 07:35:52,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:52,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181603258] [2022-11-19 07:35:52,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181603258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:52,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:52,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:35:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445176379] [2022-11-19 07:35:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:52,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:35:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:35:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:52,600 INFO L87 Difference]: Start difference. First operand 828 states and 2360 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:53,082 INFO L93 Difference]: Finished difference Result 1162 states and 3229 transitions. [2022-11-19 07:35:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:35:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:35:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:53,086 INFO L225 Difference]: With dead ends: 1162 [2022-11-19 07:35:53,086 INFO L226 Difference]: Without dead ends: 710 [2022-11-19 07:35:53,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:35:53,087 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:53,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 26 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:35:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-19 07:35:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 651. [2022-11-19 07:35:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 2.6338461538461537) internal successors, (1712), 650 states have internal predecessors, (1712), 0 states have call successors, (0), 0 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-19 07:35:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1712 transitions. [2022-11-19 07:35:53,109 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1712 transitions. Word has length 23 [2022-11-19 07:35:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:53,109 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 1712 transitions. [2022-11-19 07:35:53,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1712 transitions. [2022-11-19 07:35:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:35:53,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:53,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:53,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:35:53,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash 692192704, now seen corresponding path program 2 times [2022-11-19 07:35:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:53,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875646300] [2022-11-19 07:35:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:53,436 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-19 07:35:53,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:53,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875646300] [2022-11-19 07:35:53,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875646300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:53,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:53,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:35:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871367137] [2022-11-19 07:35:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:53,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:35:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:35:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:53,439 INFO L87 Difference]: Start difference. First operand 651 states and 1712 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:53,582 INFO L93 Difference]: Finished difference Result 595 states and 1604 transitions. [2022-11-19 07:35:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:35:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-19 07:35:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:53,584 INFO L225 Difference]: With dead ends: 595 [2022-11-19 07:35:53,584 INFO L226 Difference]: Without dead ends: 229 [2022-11-19 07:35:53,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:53,585 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 134 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:53,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 14 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:35:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-19 07:35:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 185. [2022-11-19 07:35:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.472826086956522) internal successors, (455), 184 states have internal predecessors, (455), 0 states have call successors, (0), 0 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-19 07:35:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2022-11-19 07:35:53,592 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 23 [2022-11-19 07:35:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:53,592 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2022-11-19 07:35:53,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2022-11-19 07:35:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:35:53,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:53,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:53,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:35:53,598 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1264965273, now seen corresponding path program 1 times [2022-11-19 07:35:53,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:53,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763510899] [2022-11-19 07:35:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:53,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:54,670 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-19 07:35:54,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:54,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763510899] [2022-11-19 07:35:54,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763510899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:54,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:54,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:35:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857340357] [2022-11-19 07:35:54,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:54,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 07:35:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:54,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 07:35:54,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:35:54,674 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:55,145 INFO L93 Difference]: Finished difference Result 355 states and 873 transitions. [2022-11-19 07:35:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:35:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:35:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:55,146 INFO L225 Difference]: With dead ends: 355 [2022-11-19 07:35:55,146 INFO L226 Difference]: Without dead ends: 173 [2022-11-19 07:35:55,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:35:55,147 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:55,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:35:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-19 07:35:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-11-19 07:35:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.505813953488372) internal successors, (431), 172 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-19 07:35:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 431 transitions. [2022-11-19 07:35:55,153 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 431 transitions. Word has length 27 [2022-11-19 07:35:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:55,153 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 431 transitions. [2022-11-19 07:35:55,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:55,156 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 431 transitions. [2022-11-19 07:35:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:35:55,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:55,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:55,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:35:55,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:55,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1778327131, now seen corresponding path program 2 times [2022-11-19 07:35:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:55,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317420090] [2022-11-19 07:35:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:56,688 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-19 07:35:56,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:56,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317420090] [2022-11-19 07:35:56,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317420090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:56,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:56,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-19 07:35:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796925363] [2022-11-19 07:35:56,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:56,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-19 07:35:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-19 07:35:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:35:56,692 INFO L87 Difference]: Start difference. First operand 173 states and 431 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:57,229 INFO L93 Difference]: Finished difference Result 251 states and 605 transitions. [2022-11-19 07:35:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:35:57,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:35:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:57,231 INFO L225 Difference]: With dead ends: 251 [2022-11-19 07:35:57,231 INFO L226 Difference]: Without dead ends: 173 [2022-11-19 07:35:57,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:35:57,232 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:57,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 53 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:35:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-19 07:35:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-11-19 07:35:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.4593023255813953) internal successors, (423), 172 states have internal predecessors, (423), 0 states have call successors, (0), 0 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-19 07:35:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 423 transitions. [2022-11-19 07:35:57,238 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 423 transitions. Word has length 27 [2022-11-19 07:35:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:57,238 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 423 transitions. [2022-11-19 07:35:57,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 423 transitions. [2022-11-19 07:35:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:35:57,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:57,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:35:57,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1079000423, now seen corresponding path program 3 times [2022-11-19 07:35:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:57,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636980646] [2022-11-19 07:35:57,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:58,217 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-19 07:35:58,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:58,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636980646] [2022-11-19 07:35:58,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636980646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:58,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:58,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:35:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700012744] [2022-11-19 07:35:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:58,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:35:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:58,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:35:58,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:35:58,219 INFO L87 Difference]: Start difference. First operand 173 states and 423 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:35:58,604 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2022-11-19 07:35:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:35:58,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:35:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:35:58,605 INFO L225 Difference]: With dead ends: 232 [2022-11-19 07:35:58,605 INFO L226 Difference]: Without dead ends: 97 [2022-11-19 07:35:58,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:35:58,606 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:35:58,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 24 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:35:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-19 07:35:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-19 07:35:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 92 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-19 07:35:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2022-11-19 07:35:58,609 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2022-11-19 07:35:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:35:58,610 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2022-11-19 07:35:58,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:35:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2022-11-19 07:35:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:35:58,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:35:58,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:35:58,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:35:58,611 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:35:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:35:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash -773883799, now seen corresponding path program 4 times [2022-11-19 07:35:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:35:58,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283745862] [2022-11-19 07:35:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:35:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:35:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:35:59,874 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-19 07:35:59,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:35:59,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283745862] [2022-11-19 07:35:59,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283745862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:35:59,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:35:59,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:35:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070830695] [2022-11-19 07:35:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:35:59,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:35:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:35:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:35:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:35:59,876 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:00,229 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2022-11-19 07:36:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:36:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:36:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:00,231 INFO L225 Difference]: With dead ends: 120 [2022-11-19 07:36:00,231 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 07:36:00,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:36:00,232 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:00,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 25 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:36:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 07:36:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 07:36:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.921875) internal successors, (123), 64 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-19 07:36:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2022-11-19 07:36:00,235 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2022-11-19 07:36:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:00,235 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2022-11-19 07:36:00,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2022-11-19 07:36:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:36:00,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:00,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:00,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:36:00,236 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:00,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1314365153, now seen corresponding path program 5 times [2022-11-19 07:36:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:36:00,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363113195] [2022-11-19 07:36:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:36:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:36:00,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:36:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:36:00,425 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:36:00,425 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:36:00,427 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-19 07:36:00,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-19 07:36:00,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-19 07:36:00,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-19 07:36:00,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-19 07:36:00,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-19 07:36:00,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-19 07:36:00,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-19 07:36:00,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-19 07:36:00,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-19 07:36:00,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-19 07:36:00,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-19 07:36:00,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-19 07:36:00,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-19 07:36:00,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-19 07:36:00,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-19 07:36:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:36:00,437 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:00,443 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:36:00,444 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:36:00,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:36:00 BasicIcfg [2022-11-19 07:36:00,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:36:00,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:36:00,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:36:00,580 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:36:00,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:29" (3/4) ... [2022-11-19 07:36:00,584 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:36:00,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:36:00,585 INFO L158 Benchmark]: Toolchain (without parser) took 32726.44ms. Allocated memory was 125.8MB in the beginning and 539.0MB in the end (delta: 413.1MB). Free memory was 88.0MB in the beginning and 307.7MB in the end (delta: -219.7MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB. [2022-11-19 07:36:00,585 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 125.8MB. Free memory was 105.9MB in the beginning and 105.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:36:00,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.03ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 88.8MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:36:00,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.65ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 85.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:36:00,587 INFO L158 Benchmark]: Boogie Preprocessor took 59.95ms. Allocated memory is still 125.8MB. Free memory was 85.8MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:36:00,587 INFO L158 Benchmark]: RCFGBuilder took 1177.62ms. Allocated memory is still 125.8MB. Free memory was 83.7MB in the beginning and 97.2MB in the end (delta: -13.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-19 07:36:00,588 INFO L158 Benchmark]: TraceAbstraction took 30710.80ms. Allocated memory was 125.8MB in the beginning and 539.0MB in the end (delta: 413.1MB). Free memory was 96.5MB in the beginning and 307.7MB in the end (delta: -211.2MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2022-11-19 07:36:00,588 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 539.0MB. Free memory is still 307.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:36:00,590 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.35ms. Allocated memory is still 125.8MB. Free memory was 105.9MB in the beginning and 105.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.03ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 88.8MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.65ms. Allocated memory is still 125.8MB. Free memory was 88.8MB in the beginning and 85.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.95ms. Allocated memory is still 125.8MB. Free memory was 85.8MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1177.62ms. Allocated memory is still 125.8MB. Free memory was 83.7MB in the beginning and 97.2MB in the end (delta: -13.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30710.80ms. Allocated memory was 125.8MB in the beginning and 539.0MB in the end (delta: 413.1MB). Free memory was 96.5MB in the beginning and 307.7MB in the end (delta: -211.2MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 539.0MB. Free memory is still 307.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 160 PlacesBefore, 55 PlacesAfterwards, 149 TransitionsBefore, 43 TransitionsAfterwards, 3490 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 8851 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4191, independent: 3994, independent conditional: 0, independent unconditional: 3994, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2497, independent: 2437, independent conditional: 0, independent unconditional: 2437, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2497, independent: 2415, independent conditional: 0, independent unconditional: 2415, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 537, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 499, dependent conditional: 0, dependent unconditional: 499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4191, independent: 1557, independent conditional: 0, independent unconditional: 1557, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 2497, unknown conditional: 0, unknown unconditional: 2497] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 256, Positive conditional cache size: 0, Positive unconditional cache size: 256, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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: [L740] 0 _Bool z$r_buff1_thd4; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L747] 0 _Bool weak$$choice0; [L745] 0 int z$w_buff1; [L748] 0 _Bool weak$$choice2; [L729] 0 _Bool z$flush_delayed; [L743] 0 int z$w_buff0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool z$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EBX = 0; [L734] 0 _Bool z$r_buff0_thd3; [L730] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd4; [L741] 0 _Bool z$read_delayed; [L718] 0 int a = 0; [L720] 0 int b = 0; [L742] 0 int *z$read_delayed_var; [L746] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L721] 0 _Bool main$tmp_guard0; [L744] 0 _Bool z$w_buff0_used; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: -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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 849]: 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: 847]: 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 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 864 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 864 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2365 IncrementalHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 126 mSDtfsCounter, 2365 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3924occurred in iteration=0, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 3197 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 3443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-19 07:36:00,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS --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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- 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-8393723 [2022-11-19 07:36:03,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:36:03,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:36:03,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:36:03,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:36:03,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:36:03,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:36:03,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:36:03,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:36:03,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:36:03,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:36:03,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:36:03,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:36:03,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:36:03,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:36:03,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:36:03,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:36:03,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:36:03,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:36:03,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:36:03,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:36:03,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:36:03,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:36:03,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:36:03,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:36:03,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:36:03,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:36:03,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:36:03,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:36:03,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:36:03,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:36:03,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:36:03,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:36:03,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:36:03,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:36:03,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:36:03,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:36:03,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:36:03,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:36:03,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:36:03,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:36:03,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:36:03,298 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:36:03,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:36:03,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:36:03,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:36:03,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:36:03,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:36:03,302 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:36:03,302 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:36:03,302 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:36:03,303 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:36:03,304 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:36:03,304 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:36:03,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:36:03,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:36:03,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:36:03,307 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:36:03,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:36:03,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:36:03,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:36:03,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:36:03,308 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:36:03,308 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:36:03,308 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:36:03,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:36:03,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:36:03,309 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:36:03,309 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:36:03,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:36:03,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:36:03,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:36:03,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:36:03,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:36:03,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:36:03,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:36:03,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:36:03,313 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:36:03,313 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:36:03,313 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:36:03,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:36:03,314 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_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS 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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2022-11-19 07:36:03,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:36:03,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:36:03,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:36:03,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:36:03,750 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:36:03,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-19 07:36:03,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/3db666c5d/fa0d1db462924f4b86d2095ad594edd0/FLAG265bd9f1d [2022-11-19 07:36:04,607 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:36:04,607 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-19 07:36:04,624 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/3db666c5d/fa0d1db462924f4b86d2095ad594edd0/FLAG265bd9f1d [2022-11-19 07:36:04,869 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/data/3db666c5d/fa0d1db462924f4b86d2095ad594edd0 [2022-11-19 07:36:04,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:36:04,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:36:04,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:36:04,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:36:04,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:36:04,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:36:04" (1/1) ... [2022-11-19 07:36:04,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f519cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:04, skipping insertion in model container [2022-11-19 07:36:04,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:36:04" (1/1) ... [2022-11-19 07:36:04,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:36:04,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:36:05,140 WARN L234 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_59a8264a-e9b4-4397-9c58-53847414ea34/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-19 07:36:05,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:36:05,478 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:36:05,492 WARN L234 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_59a8264a-e9b4-4397-9c58-53847414ea34/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-19 07:36:05,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:36:05,630 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:36:05,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05 WrapperNode [2022-11-19 07:36:05,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:36:05,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:36:05,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:36:05,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:36:05,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,732 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2022-11-19 07:36:05,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:36:05,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:36:05,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:36:05,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:36:05,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,798 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:36:05,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:36:05,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:36:05,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:36:05,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (1/1) ... [2022-11-19 07:36:05,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:36:05,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:36:05,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:36:05,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:36:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:36:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:36:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:36:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:36:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:36:05,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:36:05,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:36:05,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:36:05,948 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:36:05,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:36:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:36:05,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:36:05,949 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:36:05,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:36:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:36:05,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:36:05,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:36:05,952 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:36:06,255 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:36:06,258 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:36:06,825 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:36:07,067 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:36:07,068 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:36:07,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:36:07 BoogieIcfgContainer [2022-11-19 07:36:07,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:36:07,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:36:07,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:36:07,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:36:07,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:36:04" (1/3) ... [2022-11-19 07:36:07,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d07787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:36:07, skipping insertion in model container [2022-11-19 07:36:07,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:36:05" (2/3) ... [2022-11-19 07:36:07,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d07787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:36:07, skipping insertion in model container [2022-11-19 07:36:07,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:36:07" (3/3) ... [2022-11-19 07:36:07,083 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-11-19 07:36:07,111 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:36:07,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-19 07:36:07,112 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:36:07,226 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:36:07,275 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:36:07,298 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-19 07:36:07,302 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-19 07:36:07,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-19 07:36:07,397 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-19 07:36:07,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:36:07,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-19 07:36:07,406 INFO L119 LiptonReduction]: Number of co-enabled transitions 3490 [2022-11-19 07:36:21,274 INFO L134 LiptonReduction]: Checked pairs total: 8969 [2022-11-19 07:36:21,275 INFO L136 LiptonReduction]: Total number of compositions: 144 [2022-11-19 07:36:21,284 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 43 transitions, 106 flow [2022-11-19 07:36:21,551 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 0 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-19 07:36:21,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:36:21,582 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;@5b3582a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:36:21,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-19 07:36:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 0 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-19 07:36:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:36:21,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:21,606 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:36:21,607 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 610, now seen corresponding path program 1 times [2022-11-19 07:36:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:21,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127201297] [2022-11-19 07:36:21,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:21,629 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-19 07:36:21,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:21,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:21,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:21,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:36:21,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:36:21,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:21,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:21,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127201297] [2022-11-19 07:36:21,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127201297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:21,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:21,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:36:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912758248] [2022-11-19 07:36:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:21,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:36:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:36:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:36:21,807 INFO L87 Difference]: Start difference. First operand has 3924 states, 3911 states have (on average 4.0460240347737155) internal successors, (15824), 3923 states have internal predecessors, (15824), 0 states have call successors, (0), 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-19 07:36:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:22,169 INFO L93 Difference]: Finished difference Result 3722 states and 14640 transitions. [2022-11-19 07:36:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:36:22,173 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-19 07:36:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:22,228 INFO L225 Difference]: With dead ends: 3722 [2022-11-19 07:36:22,228 INFO L226 Difference]: Without dead ends: 3722 [2022-11-19 07:36:22,229 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-19 07:36:22,233 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:22,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:36:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-11-19 07:36:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3722. [2022-11-19 07:36:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3717 states have (on average 3.9386602098466503) internal successors, (14640), 3721 states have internal predecessors, (14640), 0 states have call successors, (0), 0 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-19 07:36:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 14640 transitions. [2022-11-19 07:36:22,612 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 14640 transitions. Word has length 1 [2022-11-19 07:36:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:22,612 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 14640 transitions. [2022-11-19 07:36:22,613 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-19 07:36:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 14640 transitions. [2022-11-19 07:36:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:36:22,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:22,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:22,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:22,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:22,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1575531155, now seen corresponding path program 1 times [2022-11-19 07:36:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:22,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754680407] [2022-11-19 07:36:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:22,820 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-19 07:36:22,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:22,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:22,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:23,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:36:23,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:23,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-19 07:36:23,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:23,117 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754680407] [2022-11-19 07:36:23,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754680407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:23,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:23,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:36:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734546875] [2022-11-19 07:36:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:23,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:36:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:23,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:36:23,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:36:23,123 INFO L87 Difference]: Start difference. First operand 3722 states and 14640 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 07:36:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:23,346 INFO L93 Difference]: Finished difference Result 3162 states and 12312 transitions. [2022-11-19 07:36:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:36:23,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 07:36:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:23,381 INFO L225 Difference]: With dead ends: 3162 [2022-11-19 07:36:23,381 INFO L226 Difference]: Without dead ends: 3082 [2022-11-19 07:36:23,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-19 07:36:23,383 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:23,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:36:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2022-11-19 07:36:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3082. [2022-11-19 07:36:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 3080 states have (on average 3.911688311688312) internal successors, (12048), 3081 states have internal predecessors, (12048), 0 states have call successors, (0), 0 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-19 07:36:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 12048 transitions. [2022-11-19 07:36:23,560 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 12048 transitions. Word has length 9 [2022-11-19 07:36:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:23,561 INFO L495 AbstractCegarLoop]: Abstraction has 3082 states and 12048 transitions. [2022-11-19 07:36:23,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 07:36:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 12048 transitions. [2022-11-19 07:36:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:36:23,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:23,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:23,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:23,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:23,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2038085221, now seen corresponding path program 1 times [2022-11-19 07:36:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:23,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312962057] [2022-11-19 07:36:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:23,787 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-19 07:36:23,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:23,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:23,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:23,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:36:23,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:24,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-19 07:36:24,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:24,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:24,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312962057] [2022-11-19 07:36:24,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312962057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:24,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:24,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:36:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901578276] [2022-11-19 07:36:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:24,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:36:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:36:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:36:24,033 INFO L87 Difference]: Start difference. First operand 3082 states and 12048 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-19 07:36:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:24,446 INFO L93 Difference]: Finished difference Result 2662 states and 9232 transitions. [2022-11-19 07:36:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:36:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-19 07:36:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:24,464 INFO L225 Difference]: With dead ends: 2662 [2022-11-19 07:36:24,465 INFO L226 Difference]: Without dead ends: 2182 [2022-11-19 07:36:24,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-19 07:36:24,470 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:24,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 20 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:36:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2022-11-19 07:36:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2182. [2022-11-19 07:36:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2180 states have (on average 3.4623853211009172) internal successors, (7548), 2181 states have internal predecessors, (7548), 0 states have call successors, (0), 0 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-19 07:36:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 7548 transitions. [2022-11-19 07:36:24,602 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 7548 transitions. Word has length 11 [2022-11-19 07:36:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:24,602 INFO L495 AbstractCegarLoop]: Abstraction has 2182 states and 7548 transitions. [2022-11-19 07:36:24,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-19 07:36:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 7548 transitions. [2022-11-19 07:36:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:36:24,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:24,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:24,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:24,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:24,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:24,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1206264804, now seen corresponding path program 1 times [2022-11-19 07:36:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:24,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410864163] [2022-11-19 07:36:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:24,826 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-19 07:36:24,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:24,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:24,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:25,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:36:25,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:25,098 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-19 07:36:25,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:25,098 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:25,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410864163] [2022-11-19 07:36:25,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410864163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:25,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:25,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:36:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765370287] [2022-11-19 07:36:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:25,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:36:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:36:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:36:25,103 INFO L87 Difference]: Start difference. First operand 2182 states and 7548 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-19 07:36:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:25,468 INFO L93 Difference]: Finished difference Result 1477 states and 4513 transitions. [2022-11-19 07:36:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:36:25,469 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-19 07:36:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:25,478 INFO L225 Difference]: With dead ends: 1477 [2022-11-19 07:36:25,479 INFO L226 Difference]: Without dead ends: 1177 [2022-11-19 07:36:25,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-19 07:36:25,480 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:25,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:36:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-11-19 07:36:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2022-11-19 07:36:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1175 states have (on average 3.0025531914893615) internal successors, (3528), 1176 states have internal predecessors, (3528), 0 states have call successors, (0), 0 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-19 07:36:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 3528 transitions. [2022-11-19 07:36:25,617 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 3528 transitions. Word has length 14 [2022-11-19 07:36:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:25,617 INFO L495 AbstractCegarLoop]: Abstraction has 1177 states and 3528 transitions. [2022-11-19 07:36:25,617 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-19 07:36:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 3528 transitions. [2022-11-19 07:36:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:36:25,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:25,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:25,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:25,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:25,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2120078273, now seen corresponding path program 1 times [2022-11-19 07:36:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:25,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312246279] [2022-11-19 07:36:25,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:25,847 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-19 07:36:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:25,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:25,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:26,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:36:26,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:26,125 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-19 07:36:26,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:26,126 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:26,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312246279] [2022-11-19 07:36:26,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312246279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:26,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:36:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58306070] [2022-11-19 07:36:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:26,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:36:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:36:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:36:26,130 INFO L87 Difference]: Start difference. First operand 1177 states and 3528 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-19 07:36:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:26,587 INFO L93 Difference]: Finished difference Result 861 states and 2547 transitions. [2022-11-19 07:36:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:36:26,589 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-19 07:36:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:26,595 INFO L225 Difference]: With dead ends: 861 [2022-11-19 07:36:26,595 INFO L226 Difference]: Without dead ends: 762 [2022-11-19 07:36:26,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-19 07:36:26,597 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:26,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 64 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:36:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-11-19 07:36:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2022-11-19 07:36:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 760 states have (on average 3.0039473684210525) internal successors, (2283), 761 states have internal predecessors, (2283), 0 states have call successors, (0), 0 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-19 07:36:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 2283 transitions. [2022-11-19 07:36:26,634 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 2283 transitions. Word has length 17 [2022-11-19 07:36:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:26,635 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 2283 transitions. [2022-11-19 07:36:26,635 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-19 07:36:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 2283 transitions. [2022-11-19 07:36:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:36:26,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:26,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:26,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:26,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:26,855 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1033327457, now seen corresponding path program 1 times [2022-11-19 07:36:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:26,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958542488] [2022-11-19 07:36:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:26,857 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-19 07:36:26,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:26,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:26,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:27,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:36:27,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:27,182 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-19 07:36:27,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:27,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:27,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958542488] [2022-11-19 07:36:27,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958542488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:27,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:27,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:36:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257059550] [2022-11-19 07:36:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:27,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:36:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:27,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:36:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:36:27,185 INFO L87 Difference]: Start difference. First operand 762 states and 2283 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:27,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:27,695 INFO L93 Difference]: Finished difference Result 703 states and 2163 transitions. [2022-11-19 07:36:27,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:36:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:36:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:27,701 INFO L225 Difference]: With dead ends: 703 [2022-11-19 07:36:27,701 INFO L226 Difference]: Without dead ends: 687 [2022-11-19 07:36:27,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:36:27,702 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:27,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 96 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:36:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-11-19 07:36:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-11-19 07:36:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 685 states have (on average 3.113868613138686) internal successors, (2133), 686 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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-19 07:36:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2133 transitions. [2022-11-19 07:36:27,731 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2133 transitions. Word has length 21 [2022-11-19 07:36:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:27,732 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 2133 transitions. [2022-11-19 07:36:27,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2133 transitions. [2022-11-19 07:36:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:36:27,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:27,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:27,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:27,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:27,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1456078307, now seen corresponding path program 1 times [2022-11-19 07:36:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:27,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130029559] [2022-11-19 07:36:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:36:27,953 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-19 07:36:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:27,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:27,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:36:28,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:36:28,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:28,213 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-19 07:36:28,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:28,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130029559] [2022-11-19 07:36:28,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130029559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:28,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:28,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:36:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302395927] [2022-11-19 07:36:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:28,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:36:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:28,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:36:28,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:36:28,217 INFO L87 Difference]: Start difference. First operand 687 states and 2133 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:28,418 INFO L93 Difference]: Finished difference Result 947 states and 2873 transitions. [2022-11-19 07:36:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:36:28,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:36:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:28,425 INFO L225 Difference]: With dead ends: 947 [2022-11-19 07:36:28,425 INFO L226 Difference]: Without dead ends: 947 [2022-11-19 07:36:28,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-19 07:36:28,426 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:28,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:36:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-11-19 07:36:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 945. [2022-11-19 07:36:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 943 states have (on average 3.04559915164369) internal successors, (2872), 944 states have internal predecessors, (2872), 0 states have call successors, (0), 0 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-19 07:36:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2872 transitions. [2022-11-19 07:36:28,466 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2872 transitions. Word has length 26 [2022-11-19 07:36:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:28,467 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 2872 transitions. [2022-11-19 07:36:28,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2872 transitions. [2022-11-19 07:36:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:36:28,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:28,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:28,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:28,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:28,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 432294713, now seen corresponding path program 2 times [2022-11-19 07:36:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:28,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990294966] [2022-11-19 07:36:28,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:36:28,705 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-19 07:36:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:28,706 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:28,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:28,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:36:28,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:36:28,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:36:28,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:28,939 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-19 07:36:28,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:28,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:28,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990294966] [2022-11-19 07:36:28,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990294966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:28,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:28,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:36:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358377225] [2022-11-19 07:36:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:28,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:36:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:28,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:36:28,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:36:28,944 INFO L87 Difference]: Start difference. First operand 945 states and 2872 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:29,169 INFO L93 Difference]: Finished difference Result 1203 states and 3584 transitions. [2022-11-19 07:36:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:36:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:36:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:29,178 INFO L225 Difference]: With dead ends: 1203 [2022-11-19 07:36:29,178 INFO L226 Difference]: Without dead ends: 1203 [2022-11-19 07:36:29,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-19 07:36:29,179 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:29,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:36:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-11-19 07:36:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 861. [2022-11-19 07:36:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 859 states have (on average 3.0651920838183937) internal successors, (2633), 860 states have internal predecessors, (2633), 0 states have call successors, (0), 0 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-19 07:36:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2633 transitions. [2022-11-19 07:36:29,215 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 2633 transitions. Word has length 26 [2022-11-19 07:36:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:29,215 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 2633 transitions. [2022-11-19 07:36:29,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 2633 transitions. [2022-11-19 07:36:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:36:29,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:29,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:29,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:29,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:29,438 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:29,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:29,439 INFO L85 PathProgramCache]: Analyzing trace with hash 56289139, now seen corresponding path program 3 times [2022-11-19 07:36:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:29,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889818710] [2022-11-19 07:36:29,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:36:29,439 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-19 07:36:29,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:29,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:29,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-19 07:36:29,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:36:29,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:36:29,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:36:29,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:36:29,654 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-19 07:36:29,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:36:29,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:36:29,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889818710] [2022-11-19 07:36:29,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889818710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:36:29,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:36:29,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:36:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830708491] [2022-11-19 07:36:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:36:29,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:36:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:36:29,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:36:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:36:29,657 INFO L87 Difference]: Start difference. First operand 861 states and 2633 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:36:29,816 INFO L93 Difference]: Finished difference Result 1185 states and 3515 transitions. [2022-11-19 07:36:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:36:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:36:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:36:29,824 INFO L225 Difference]: With dead ends: 1185 [2022-11-19 07:36:29,824 INFO L226 Difference]: Without dead ends: 1185 [2022-11-19 07:36:29,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-19 07:36:29,825 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 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, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:36:29,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:36:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-11-19 07:36:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 764. [2022-11-19 07:36:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 762 states have (on average 3.061679790026247) internal successors, (2333), 763 states have internal predecessors, (2333), 0 states have call successors, (0), 0 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-19 07:36:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2333 transitions. [2022-11-19 07:36:29,869 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2333 transitions. Word has length 26 [2022-11-19 07:36:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:36:29,870 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 2333 transitions. [2022-11-19 07:36:29,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:36:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2333 transitions. [2022-11-19 07:36:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:36:29,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:36:29,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:29,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:36:30,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:30,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:36:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:36:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1195060301, now seen corresponding path program 4 times [2022-11-19 07:36:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:36:30,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394532134] [2022-11-19 07:36:30,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:36:30,090 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-19 07:36:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:36:30,092 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:30,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-19 07:36:30,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:36:30,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:36:30,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:36:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:36:30,610 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:36:30,625 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:36:30,627 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-19 07:36:30,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-19 07:36:30,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-19 07:36:30,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-19 07:36:30,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-19 07:36:30,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-19 07:36:30,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-19 07:36:30,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-19 07:36:30,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-19 07:36:30,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-19 07:36:30,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-19 07:36:30,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-19 07:36:30,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-19 07:36:30,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-19 07:36:30,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-19 07:36:30,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-19 07:36:30,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:36:30,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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-19 07:36:30,864 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-19 07:36:30,870 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:36:30,870 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:36:31,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:36:31 BasicIcfg [2022-11-19 07:36:31,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:36:31,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:36:31,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:36:31,023 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:36:31,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:36:07" (3/4) ... [2022-11-19 07:36:31,026 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:36:31,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:36:31,036 INFO L158 Benchmark]: Toolchain (without parser) took 26162.75ms. Allocated memory was 67.1MB in the beginning and 260.0MB in the end (delta: 192.9MB). Free memory was 46.2MB in the beginning and 155.0MB in the end (delta: -108.8MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2022-11-19 07:36:31,036 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:36:31,037 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.56ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 39.0MB in the end (delta: 7.0MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-11-19 07:36:31,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.15ms. Allocated memory is still 67.1MB. Free memory was 39.0MB in the beginning and 36.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:36:31,037 INFO L158 Benchmark]: Boogie Preprocessor took 80.96ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 34.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:36:31,038 INFO L158 Benchmark]: RCFGBuilder took 1253.79ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 34.0MB in the beginning and 72.6MB in the end (delta: -38.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-11-19 07:36:31,038 INFO L158 Benchmark]: TraceAbstraction took 23946.70ms. Allocated memory was 107.0MB in the beginning and 260.0MB in the end (delta: 153.1MB). Free memory was 72.1MB in the beginning and 155.0MB in the end (delta: -82.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2022-11-19 07:36:31,038 INFO L158 Benchmark]: Witness Printer took 12.99ms. Allocated memory is still 260.0MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:36:31,040 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.37ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.56ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 39.0MB in the end (delta: 7.0MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.15ms. Allocated memory is still 67.1MB. Free memory was 39.0MB in the beginning and 36.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.96ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 34.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1253.79ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 34.0MB in the beginning and 72.6MB in the end (delta: -38.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23946.70ms. Allocated memory was 107.0MB in the beginning and 260.0MB in the end (delta: 153.1MB). Free memory was 72.1MB in the beginning and 155.0MB in the end (delta: -82.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Witness Printer took 12.99ms. Allocated memory is still 260.0MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.0s, 161 PlacesBefore, 55 PlacesAfterwards, 150 TransitionsBefore, 43 TransitionsAfterwards, 3490 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 8969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4698, independent: 4490, independent conditional: 0, independent unconditional: 4490, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2637, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2637, independent: 2516, independent conditional: 0, independent unconditional: 2516, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 121, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 823, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 689, dependent conditional: 0, dependent unconditional: 689, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4698, independent: 1936, independent conditional: 0, independent unconditional: 1936, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 2637, unknown conditional: 0, unknown unconditional: 2637] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 327, Positive conditional cache size: 0, Positive unconditional cache size: 327, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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: [L740] 0 _Bool z$r_buff1_thd4; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L747] 0 _Bool weak$$choice0; [L745] 0 int z$w_buff1; [L748] 0 _Bool weak$$choice2; [L729] 0 _Bool z$flush_delayed; [L743] 0 int z$w_buff0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool z$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EBX = 0; [L734] 0 _Bool z$r_buff0_thd3; [L730] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd4; [L741] 0 _Bool z$read_delayed; [L718] 0 int a = 0; [L720] 0 int b = 0; [L742] 0 int *z$read_delayed_var; [L746] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L721] 0 _Bool main$tmp_guard0; [L744] 0 _Bool z$w_buff0_used; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=0, t1165={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=1, t1165={11:0}, t1166={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=2, t1165={11:0}, t1166={15:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=3, t1165={11:0}, t1166={15:0}, t1167={7:0}, t1168={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={11:0}, t1166={15:0}, t1167={7:0}, t1168={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: -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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 849]: 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: 847]: 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 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1272 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 89 mSDtfsCounter, 1272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3924occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 765 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1335 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-19 07:36:31,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59a8264a-e9b4-4397-9c58-53847414ea34/bin/utaipan-I9t0OCRTmS/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