./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- 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 08:33:25,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:33:25,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:33:25,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:33:25,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:33:25,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:33:25,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:33:25,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:33:25,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:33:25,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:33:25,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:33:25,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:33:25,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:33:25,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:33:25,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:33:25,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:33:25,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:33:25,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:33:25,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:33:25,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:33:25,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:33:25,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:33:25,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:33:25,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:33:25,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:33:25,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:33:25,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:33:25,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:33:25,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:33:25,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:33:25,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:33:25,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:33:25,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:33:25,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:33:25,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:33:25,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:33:25,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:33:25,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:33:25,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:33:25,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:33:25,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:33:25,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 08:33:25,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:33:25,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:33:25,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:33:25,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:33:25,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:33:25,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:33:25,584 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:33:25,584 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:33:25,584 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:33:25,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:33:25,585 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:33:25,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:33:25,585 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:33:25,586 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:33:25,586 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:33:25,586 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:33:25,587 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:33:25,587 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:33:25,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:33:25,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:33:25,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:33:25,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:33:25,589 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:33:25,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:33:25,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:33:25,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:33:25,590 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:33:25,590 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:33:25,590 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:33:25,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:33:25,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:33:25,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:33:25,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:33:25,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:33:25,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:33:25,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:33:25,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:33:25,593 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:33:25,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:33:25,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:33:25,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:33:25,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:33:25,594 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_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-11-19 08:33:25,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:33:25,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:33:25,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:33:25,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:33:25,911 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:33:25,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 08:33:25,997 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/e82f730e0/51b954af2065480aa35a6430cc7846ee/FLAGd46b46082 [2022-11-19 08:33:26,606 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:33:26,607 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 08:33:26,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/e82f730e0/51b954af2065480aa35a6430cc7846ee/FLAGd46b46082 [2022-11-19 08:33:26,877 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/e82f730e0/51b954af2065480aa35a6430cc7846ee [2022-11-19 08:33:26,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:33:26,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:33:26,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:33:26,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:33:26,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:33:26,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:33:26" (1/1) ... [2022-11-19 08:33:26,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355fbd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:26, skipping insertion in model container [2022-11-19 08:33:26,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:33:26" (1/1) ... [2022-11-19 08:33:26,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:33:26,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:33:27,165 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_245b3324-a14f-486f-9282-6acd58bca77b/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-19 08:33:27,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:33:27,395 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:33:27,410 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_245b3324-a14f-486f-9282-6acd58bca77b/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-19 08:33:27,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:33:27,515 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:33:27,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27 WrapperNode [2022-11-19 08:33:27,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:33:27,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:33:27,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:33:27,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:33:27,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,600 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-11-19 08:33:27,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:33:27,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:33:27,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:33:27,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:33:27,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:33:27,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:33:27,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:33:27,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:33:27,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (1/1) ... [2022-11-19 08:33:27,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:33:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:33:27,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:33:27,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:33:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:33:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:33:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:33:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:33:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:33:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 08:33:27,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 08:33:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 08:33:27,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 08:33:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 08:33:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 08:33:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:33:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:33:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:33:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:33:27,767 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 08:33:27,981 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:33:27,983 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:33:28,350 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:33:28,545 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:33:28,546 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:33:28,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:33:28 BoogieIcfgContainer [2022-11-19 08:33:28,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:33:28,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:33:28,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:33:28,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:33:28,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:33:26" (1/3) ... [2022-11-19 08:33:28,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52578445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:33:28, skipping insertion in model container [2022-11-19 08:33:28,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:27" (2/3) ... [2022-11-19 08:33:28,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52578445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:33:28, skipping insertion in model container [2022-11-19 08:33:28,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:33:28" (3/3) ... [2022-11-19 08:33:28,562 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 08:33:28,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:33:28,582 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 08:33:28,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:33:28,659 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:33:28,694 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:33:28,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 261 flow [2022-11-19 08:33:28,715 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 261 flow [2022-11-19 08:33:28,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-11-19 08:33:28,772 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-11-19 08:33:28,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:33:28,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-19 08:33:28,780 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-19 08:33:35,076 INFO L134 LiptonReduction]: Checked pairs total: 6017 [2022-11-19 08:33:35,077 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-11-19 08:33:35,085 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-19 08:33:35,170 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states 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 08:33:35,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:33:35,195 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;@48a6d56b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:33:35,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 08:33:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states 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 08:33:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:33:35,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:35,206 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:33:35,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash 529, now seen corresponding path program 1 times [2022-11-19 08:33:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:35,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836067775] [2022-11-19 08:33:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:35,329 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 08:33:35,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:35,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836067775] [2022-11-19 08:33:35,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836067775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:35,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:35,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:33:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867724175] [2022-11-19 08:33:35,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:35,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:33:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:33:35,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:33:35,364 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 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 08:33:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:35,451 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-19 08:33:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:33:35,456 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 08:33:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:35,487 INFO L225 Difference]: With dead ends: 1024 [2022-11-19 08:33:35,489 INFO L226 Difference]: Without dead ends: 1024 [2022-11-19 08:33:35,493 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 08:33:35,496 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:35,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:33:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-19 08:33:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-19 08:33:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 08:33:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-19 08:33:35,656 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-19 08:33:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:35,656 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-19 08:33:35,661 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 08:33:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-19 08:33:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:33:35,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:35,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:33:35,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:33:35,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 521537, now seen corresponding path program 1 times [2022-11-19 08:33:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009381356] [2022-11-19 08:33:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:35,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:35,979 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 08:33:35,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:35,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009381356] [2022-11-19 08:33:35,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009381356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:35,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:35,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:33:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409208752] [2022-11-19 08:33:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:33:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:33:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:33:35,983 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:36,080 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-19 08:33:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:33:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:33:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:36,087 INFO L225 Difference]: With dead ends: 837 [2022-11-19 08:33:36,087 INFO L226 Difference]: Without dead ends: 812 [2022-11-19 08:33:36,088 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 08:33:36,090 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:36,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-19 08:33:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-19 08:33:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states 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 08:33:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-19 08:33:36,123 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-19 08:33:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:36,124 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-19 08:33:36,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-19 08:33:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:33:36,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:36,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:36,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:33:36,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash 777665513, now seen corresponding path program 1 times [2022-11-19 08:33:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:36,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000591492] [2022-11-19 08:33:36,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:37,046 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 08:33:37,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:37,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000591492] [2022-11-19 08:33:37,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000591492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:37,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:37,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:33:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511426803] [2022-11-19 08:33:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:37,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:33:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:33:37,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:37,049 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:37,269 INFO L93 Difference]: Finished difference Result 1202 states and 3750 transitions. [2022-11-19 08:33:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:33:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 08:33:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:37,278 INFO L225 Difference]: With dead ends: 1202 [2022-11-19 08:33:37,278 INFO L226 Difference]: Without dead ends: 1202 [2022-11-19 08:33:37,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:37,282 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:37,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:33:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-11-19 08:33:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 845. [2022-11-19 08:33:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 3.190984578884935) internal successors, (2690), 844 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states 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 08:33:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2690 transitions. [2022-11-19 08:33:37,322 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2690 transitions. Word has length 9 [2022-11-19 08:33:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:37,323 INFO L495 AbstractCegarLoop]: Abstraction has 845 states and 2690 transitions. [2022-11-19 08:33:37,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2690 transitions. [2022-11-19 08:33:37,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:33:37,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:37,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:37,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:33:37,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1662175271, now seen corresponding path program 1 times [2022-11-19 08:33:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756729772] [2022-11-19 08:33:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:38,050 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 08:33:38,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:38,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756729772] [2022-11-19 08:33:38,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756729772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:38,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:38,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:33:38,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608961326] [2022-11-19 08:33:38,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:38,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:33:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:33:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:38,053 INFO L87 Difference]: Start difference. First operand 845 states and 2690 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:38,246 INFO L93 Difference]: Finished difference Result 1194 states and 3724 transitions. [2022-11-19 08:33:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:33:38,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 08:33:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:38,254 INFO L225 Difference]: With dead ends: 1194 [2022-11-19 08:33:38,255 INFO L226 Difference]: Without dead ends: 1194 [2022-11-19 08:33:38,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:38,257 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:38,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:33:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-11-19 08:33:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 837. [2022-11-19 08:33:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 835 states have (on average 3.18562874251497) internal successors, (2660), 836 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states 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 08:33:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2660 transitions. [2022-11-19 08:33:38,291 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 2660 transitions. Word has length 10 [2022-11-19 08:33:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:38,293 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 2660 transitions. [2022-11-19 08:33:38,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 2660 transitions. [2022-11-19 08:33:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:33:38,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:38,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:38,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:33:38,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1662172184, now seen corresponding path program 1 times [2022-11-19 08:33:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:38,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023510020] [2022-11-19 08:33:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:38,866 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 08:33:38,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:38,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023510020] [2022-11-19 08:33:38,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023510020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:38,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:38,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830056525] [2022-11-19 08:33:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:38,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:38,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:38,875 INFO L87 Difference]: Start difference. First operand 837 states and 2660 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:39,107 INFO L93 Difference]: Finished difference Result 712 states and 2235 transitions. [2022-11-19 08:33:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:33:39,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 08:33:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:39,112 INFO L225 Difference]: With dead ends: 712 [2022-11-19 08:33:39,112 INFO L226 Difference]: Without dead ends: 587 [2022-11-19 08:33:39,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:39,113 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:39,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 36 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:33:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-19 08:33:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2022-11-19 08:33:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 3.015358361774744) internal successors, (1767), 586 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states 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 08:33:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1767 transitions. [2022-11-19 08:33:39,133 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1767 transitions. Word has length 10 [2022-11-19 08:33:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:39,134 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 1767 transitions. [2022-11-19 08:33:39,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1767 transitions. [2022-11-19 08:33:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:33:39,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:39,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:39,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:33:39,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1602127895, now seen corresponding path program 1 times [2022-11-19 08:33:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:39,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412338944] [2022-11-19 08:33:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:39,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 08:33:39,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:39,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412338944] [2022-11-19 08:33:39,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412338944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:39,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:39,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:33:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166124839] [2022-11-19 08:33:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:39,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:33:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:33:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:39,673 INFO L87 Difference]: Start difference. First operand 587 states and 1767 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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 08:33:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:39,758 INFO L93 Difference]: Finished difference Result 584 states and 1755 transitions. [2022-11-19 08:33:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:33:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 08:33:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:39,762 INFO L225 Difference]: With dead ends: 584 [2022-11-19 08:33:39,762 INFO L226 Difference]: Without dead ends: 584 [2022-11-19 08:33:39,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 08:33:39,763 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:39,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-19 08:33:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 583. [2022-11-19 08:33:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 3.0103092783505154) internal successors, (1752), 582 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states 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 08:33:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1752 transitions. [2022-11-19 08:33:39,782 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1752 transitions. Word has length 11 [2022-11-19 08:33:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:39,783 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1752 transitions. [2022-11-19 08:33:39,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 08:33:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1752 transitions. [2022-11-19 08:33:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:33:39,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:39,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:39,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:33:39,785 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1488491989, now seen corresponding path program 1 times [2022-11-19 08:33:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:39,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805402846] [2022-11-19 08:33:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:40,359 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 08:33:40,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805402846] [2022-11-19 08:33:40,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805402846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:40,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:40,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:33:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404850983] [2022-11-19 08:33:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:40,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:33:40,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:40,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:33:40,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:33:40,361 INFO L87 Difference]: Start difference. First operand 583 states and 1752 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 08:33:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:40,473 INFO L93 Difference]: Finished difference Result 608 states and 1816 transitions. [2022-11-19 08:33:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:33:40,474 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 08:33:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:40,478 INFO L225 Difference]: With dead ends: 608 [2022-11-19 08:33:40,478 INFO L226 Difference]: Without dead ends: 608 [2022-11-19 08:33:40,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:40,479 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:40,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-19 08:33:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2022-11-19 08:33:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 2.995008319467554) internal successors, (1800), 601 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states 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 08:33:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1800 transitions. [2022-11-19 08:33:40,501 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1800 transitions. Word has length 12 [2022-11-19 08:33:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:40,501 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 1800 transitions. [2022-11-19 08:33:40,502 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 08:33:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1800 transitions. [2022-11-19 08:33:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:33:40,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:40,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:40,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:33:40,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1873645763, now seen corresponding path program 1 times [2022-11-19 08:33:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:40,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120659195] [2022-11-19 08:33:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:40,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:40,899 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 08:33:40,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:40,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120659195] [2022-11-19 08:33:40,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120659195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:40,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:40,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:33:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190281821] [2022-11-19 08:33:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:40,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:33:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:33:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:40,902 INFO L87 Difference]: Start difference. First operand 602 states and 1800 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 08:33:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:40,994 INFO L93 Difference]: Finished difference Result 612 states and 1831 transitions. [2022-11-19 08:33:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:33:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 08:33:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:40,999 INFO L225 Difference]: With dead ends: 612 [2022-11-19 08:33:40,999 INFO L226 Difference]: Without dead ends: 612 [2022-11-19 08:33:40,999 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 08:33:41,000 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:41,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-11-19 08:33:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 605. [2022-11-19 08:33:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 2.993377483443709) internal successors, (1808), 604 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states 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 08:33:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1808 transitions. [2022-11-19 08:33:41,020 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1808 transitions. Word has length 12 [2022-11-19 08:33:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:41,020 INFO L495 AbstractCegarLoop]: Abstraction has 605 states and 1808 transitions. [2022-11-19 08:33:41,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 08:33:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1808 transitions. [2022-11-19 08:33:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:33:41,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:41,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:41,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:33:41,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1876340903, now seen corresponding path program 2 times [2022-11-19 08:33:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545579102] [2022-11-19 08:33:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:41,455 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 08:33:41,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:41,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545579102] [2022-11-19 08:33:41,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545579102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:41,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:41,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:33:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366223486] [2022-11-19 08:33:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:41,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:33:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:41,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:33:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:33:41,458 INFO L87 Difference]: Start difference. First operand 605 states and 1808 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 08:33:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:41,624 INFO L93 Difference]: Finished difference Result 598 states and 1784 transitions. [2022-11-19 08:33:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:33:41,624 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 08:33:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:41,628 INFO L225 Difference]: With dead ends: 598 [2022-11-19 08:33:41,628 INFO L226 Difference]: Without dead ends: 598 [2022-11-19 08:33:41,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:41,630 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:41,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-19 08:33:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 586. [2022-11-19 08:33:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 2.988034188034188) internal successors, (1748), 585 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states 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 08:33:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1748 transitions. [2022-11-19 08:33:41,651 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1748 transitions. Word has length 12 [2022-11-19 08:33:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:41,651 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 1748 transitions. [2022-11-19 08:33:41,652 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 08:33:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1748 transitions. [2022-11-19 08:33:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:33:41,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:41,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:33:41,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1101385641, now seen corresponding path program 1 times [2022-11-19 08:33:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:41,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733015681] [2022-11-19 08:33:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:42,018 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 08:33:42,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:42,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733015681] [2022-11-19 08:33:42,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733015681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:42,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:42,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757967501] [2022-11-19 08:33:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:42,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:42,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:42,020 INFO L87 Difference]: Start difference. First operand 586 states and 1748 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:42,197 INFO L93 Difference]: Finished difference Result 665 states and 1976 transitions. [2022-11-19 08:33:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:33:42,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:42,201 INFO L225 Difference]: With dead ends: 665 [2022-11-19 08:33:42,202 INFO L226 Difference]: Without dead ends: 665 [2022-11-19 08:33:42,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:33:42,202 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:42,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 12 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-19 08:33:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 598. [2022-11-19 08:33:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 2.976549413735343) internal successors, (1777), 597 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states 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 08:33:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1777 transitions. [2022-11-19 08:33:42,222 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1777 transitions. Word has length 13 [2022-11-19 08:33:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:42,222 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 1777 transitions. [2022-11-19 08:33:42,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1777 transitions. [2022-11-19 08:33:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:33:42,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:42,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:42,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:33:42,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1101361430, now seen corresponding path program 1 times [2022-11-19 08:33:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:42,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818715432] [2022-11-19 08:33:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:42,409 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 08:33:42,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:42,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818715432] [2022-11-19 08:33:42,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818715432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:42,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:42,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:33:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89717259] [2022-11-19 08:33:42,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:42,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:33:42,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:33:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:33:42,413 INFO L87 Difference]: Start difference. First operand 598 states and 1777 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:42,485 INFO L93 Difference]: Finished difference Result 843 states and 2439 transitions. [2022-11-19 08:33:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:33:42,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:33:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:42,489 INFO L225 Difference]: With dead ends: 843 [2022-11-19 08:33:42,490 INFO L226 Difference]: Without dead ends: 622 [2022-11-19 08:33:42,490 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 08:33:42,491 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:42,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-11-19 08:33:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 576. [2022-11-19 08:33:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 2.8678260869565215) internal successors, (1649), 575 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states 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 08:33:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1649 transitions. [2022-11-19 08:33:42,509 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1649 transitions. Word has length 13 [2022-11-19 08:33:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:42,509 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 1649 transitions. [2022-11-19 08:33:42,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1649 transitions. [2022-11-19 08:33:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:33:42,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:42,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:42,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:33:42,512 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1098690501, now seen corresponding path program 2 times [2022-11-19 08:33:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:42,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549254217] [2022-11-19 08:33:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:43,259 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 08:33:43,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:43,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549254217] [2022-11-19 08:33:43,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549254217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:43,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:43,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816048664] [2022-11-19 08:33:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:43,261 INFO L87 Difference]: Start difference. First operand 576 states and 1649 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:43,487 INFO L93 Difference]: Finished difference Result 731 states and 2099 transitions. [2022-11-19 08:33:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:33:43,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:43,491 INFO L225 Difference]: With dead ends: 731 [2022-11-19 08:33:43,492 INFO L226 Difference]: Without dead ends: 731 [2022-11-19 08:33:43,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:33:43,492 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:43,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 17 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:33:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-11-19 08:33:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 596. [2022-11-19 08:33:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 2.892436974789916) internal successors, (1721), 595 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states 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 08:33:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1721 transitions. [2022-11-19 08:33:43,511 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1721 transitions. Word has length 13 [2022-11-19 08:33:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:43,511 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1721 transitions. [2022-11-19 08:33:43,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1721 transitions. [2022-11-19 08:33:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:33:43,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:43,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:43,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:33:43,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1962972869, now seen corresponding path program 3 times [2022-11-19 08:33:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:43,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181030484] [2022-11-19 08:33:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:43,948 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 08:33:43,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181030484] [2022-11-19 08:33:43,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181030484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:43,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:43,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420897671] [2022-11-19 08:33:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:43,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:43,951 INFO L87 Difference]: Start difference. First operand 596 states and 1721 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:44,173 INFO L93 Difference]: Finished difference Result 685 states and 1960 transitions. [2022-11-19 08:33:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:33:44,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:44,178 INFO L225 Difference]: With dead ends: 685 [2022-11-19 08:33:44,178 INFO L226 Difference]: Without dead ends: 685 [2022-11-19 08:33:44,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:33:44,178 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:44,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 11 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:33:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-19 08:33:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 619. [2022-11-19 08:33:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 2.872168284789644) internal successors, (1775), 618 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states 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 08:33:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1775 transitions. [2022-11-19 08:33:44,198 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1775 transitions. Word has length 13 [2022-11-19 08:33:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:44,198 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 1775 transitions. [2022-11-19 08:33:44,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 08:33:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1775 transitions. [2022-11-19 08:33:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 08:33:44,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:44,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:44,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 08:33:44,200 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1431907178, now seen corresponding path program 1 times [2022-11-19 08:33:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487859739] [2022-11-19 08:33:44,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:44,333 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 08:33:44,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:44,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487859739] [2022-11-19 08:33:44,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487859739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:44,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:44,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:33:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826892249] [2022-11-19 08:33:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:44,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:33:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:33:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:33:44,336 INFO L87 Difference]: Start difference. First operand 619 states and 1775 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:44,413 INFO L93 Difference]: Finished difference Result 865 states and 2389 transitions. [2022-11-19 08:33:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:33:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 08:33:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:44,417 INFO L225 Difference]: With dead ends: 865 [2022-11-19 08:33:44,417 INFO L226 Difference]: Without dead ends: 571 [2022-11-19 08:33:44,417 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 08:33:44,418 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:44,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-19 08:33:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 533. [2022-11-19 08:33:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 2.6522556390977443) internal successors, (1411), 532 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states 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 08:33:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1411 transitions. [2022-11-19 08:33:44,433 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1411 transitions. Word has length 13 [2022-11-19 08:33:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:44,434 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 1411 transitions. [2022-11-19 08:33:44,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1411 transitions. [2022-11-19 08:33:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:33:44,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:44,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:44,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 08:33:44,436 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -216786422, now seen corresponding path program 1 times [2022-11-19 08:33:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:44,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838151822] [2022-11-19 08:33:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:45,126 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 08:33:45,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:45,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838151822] [2022-11-19 08:33:45,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838151822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:45,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:45,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:33:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070911561] [2022-11-19 08:33:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:45,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:33:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:33:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:33:45,128 INFO L87 Difference]: Start difference. First operand 533 states and 1411 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:45,336 INFO L93 Difference]: Finished difference Result 687 states and 1758 transitions. [2022-11-19 08:33:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:33:45,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:33:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:45,340 INFO L225 Difference]: With dead ends: 687 [2022-11-19 08:33:45,340 INFO L226 Difference]: Without dead ends: 527 [2022-11-19 08:33:45,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:33:45,340 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 80 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:45,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 14 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-19 08:33:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 463. [2022-11-19 08:33:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.5974025974025974) internal successors, (1200), 462 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states 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 08:33:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1200 transitions. [2022-11-19 08:33:45,354 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1200 transitions. Word has length 14 [2022-11-19 08:33:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:45,355 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1200 transitions. [2022-11-19 08:33:45,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1200 transitions. [2022-11-19 08:33:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:33:45,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:45,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 08:33:45,356 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -217536436, now seen corresponding path program 1 times [2022-11-19 08:33:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581542538] [2022-11-19 08:33:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:46,166 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 08:33:46,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:46,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581542538] [2022-11-19 08:33:46,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581542538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:46,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:46,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92179350] [2022-11-19 08:33:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:46,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:46,168 INFO L87 Difference]: Start difference. First operand 463 states and 1200 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:46,350 INFO L93 Difference]: Finished difference Result 497 states and 1284 transitions. [2022-11-19 08:33:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:33:46,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:33:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:46,353 INFO L225 Difference]: With dead ends: 497 [2022-11-19 08:33:46,354 INFO L226 Difference]: Without dead ends: 481 [2022-11-19 08:33:46,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:33:46,354 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:46,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 13 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-19 08:33:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 463. [2022-11-19 08:33:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.5974025974025974) internal successors, (1200), 462 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states 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 08:33:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1200 transitions. [2022-11-19 08:33:46,367 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1200 transitions. Word has length 14 [2022-11-19 08:33:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:46,368 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1200 transitions. [2022-11-19 08:33:46,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1200 transitions. [2022-11-19 08:33:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:33:46,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:46,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:46,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 08:33:46,370 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash -949342800, now seen corresponding path program 2 times [2022-11-19 08:33:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476409335] [2022-11-19 08:33:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:47,023 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 08:33:47,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:47,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476409335] [2022-11-19 08:33:47,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476409335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:47,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:47,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304998151] [2022-11-19 08:33:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:47,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:47,026 INFO L87 Difference]: Start difference. First operand 463 states and 1200 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:47,166 INFO L93 Difference]: Finished difference Result 459 states and 1186 transitions. [2022-11-19 08:33:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:33:47,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:33:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:47,169 INFO L225 Difference]: With dead ends: 459 [2022-11-19 08:33:47,169 INFO L226 Difference]: Without dead ends: 455 [2022-11-19 08:33:47,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:33:47,170 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:47,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-19 08:33:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 443. [2022-11-19 08:33:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 2.6063348416289593) internal successors, (1152), 442 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states 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 08:33:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1152 transitions. [2022-11-19 08:33:47,184 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1152 transitions. Word has length 14 [2022-11-19 08:33:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:47,184 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 1152 transitions. [2022-11-19 08:33:47,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1152 transitions. [2022-11-19 08:33:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:33:47,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:47,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:47,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 08:33:47,186 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1265563994, now seen corresponding path program 1 times [2022-11-19 08:33:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:47,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862294694] [2022-11-19 08:33:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:47,369 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 08:33:47,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:47,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862294694] [2022-11-19 08:33:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862294694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:47,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:47,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:33:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750515796] [2022-11-19 08:33:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:47,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:33:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:33:47,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:33:47,372 INFO L87 Difference]: Start difference. First operand 443 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:47,479 INFO L93 Difference]: Finished difference Result 433 states and 990 transitions. [2022-11-19 08:33:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:33:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:33:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:47,481 INFO L225 Difference]: With dead ends: 433 [2022-11-19 08:33:47,481 INFO L226 Difference]: Without dead ends: 318 [2022-11-19 08:33:47,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:33:47,482 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:47,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-19 08:33:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-11-19 08:33:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.2460567823343847) internal successors, (712), 317 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 08:33:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 712 transitions. [2022-11-19 08:33:47,490 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 712 transitions. Word has length 14 [2022-11-19 08:33:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:47,490 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 712 transitions. [2022-11-19 08:33:47,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 712 transitions. [2022-11-19 08:33:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:33:47,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:47,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:47,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 08:33:47,492 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1852859661, now seen corresponding path program 1 times [2022-11-19 08:33:47,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:47,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043346429] [2022-11-19 08:33:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:47,640 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 08:33:47,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:47,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043346429] [2022-11-19 08:33:47,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043346429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:47,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:47,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:33:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056040489] [2022-11-19 08:33:47,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:47,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:33:47,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:47,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:33:47,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:33:47,642 INFO L87 Difference]: Start difference. First operand 318 states and 712 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 08:33:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:47,777 INFO L93 Difference]: Finished difference Result 266 states and 540 transitions. [2022-11-19 08:33:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:33:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 08:33:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:47,779 INFO L225 Difference]: With dead ends: 266 [2022-11-19 08:33:47,779 INFO L226 Difference]: Without dead ends: 203 [2022-11-19 08:33:47,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:47,780 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:47,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-19 08:33:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-11-19 08:33:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.9851485148514851) internal successors, (401), 202 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 08:33:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 401 transitions. [2022-11-19 08:33:47,785 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 401 transitions. Word has length 15 [2022-11-19 08:33:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:47,785 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 401 transitions. [2022-11-19 08:33:47,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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 08:33:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 401 transitions. [2022-11-19 08:33:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 08:33:47,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:47,786 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 08:33:47,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-19 08:33:47,787 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1638760467, now seen corresponding path program 1 times [2022-11-19 08:33:47,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:47,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028236035] [2022-11-19 08:33:47,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:48,768 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 08:33:48,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028236035] [2022-11-19 08:33:48,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028236035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:48,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:48,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:33:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291950139] [2022-11-19 08:33:48,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:48,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:33:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:33:48,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:33:48,771 INFO L87 Difference]: Start difference. First operand 203 states and 401 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 08:33:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:48,955 INFO L93 Difference]: Finished difference Result 226 states and 437 transitions. [2022-11-19 08:33:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:33:48,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 08:33:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:48,956 INFO L225 Difference]: With dead ends: 226 [2022-11-19 08:33:48,957 INFO L226 Difference]: Without dead ends: 168 [2022-11-19 08:33:48,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:33:48,957 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:48,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 14 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:33:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-19 08:33:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2022-11-19 08:33:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.9935897435897436) internal successors, (311), 156 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 08:33:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 311 transitions. [2022-11-19 08:33:48,963 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 311 transitions. Word has length 18 [2022-11-19 08:33:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:48,964 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 311 transitions. [2022-11-19 08:33:48,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 08:33:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 311 transitions. [2022-11-19 08:33:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 08:33:48,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:48,965 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 08:33:48,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 08:33:48,966 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1443037765, now seen corresponding path program 1 times [2022-11-19 08:33:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:48,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528641143] [2022-11-19 08:33:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:33:49,210 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 08:33:49,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:33:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528641143] [2022-11-19 08:33:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528641143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:33:49,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:33:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:33:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28750453] [2022-11-19 08:33:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:33:49,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:33:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:33:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:33:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:33:49,215 INFO L87 Difference]: Start difference. First operand 157 states and 311 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:33:49,341 INFO L93 Difference]: Finished difference Result 141 states and 279 transitions. [2022-11-19 08:33:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:33:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 08:33:49,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:33:49,342 INFO L225 Difference]: With dead ends: 141 [2022-11-19 08:33:49,342 INFO L226 Difference]: Without dead ends: 62 [2022-11-19 08:33:49,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:33:49,343 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:33:49,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:33:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-19 08:33:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-19 08:33:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 61 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 08:33:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2022-11-19 08:33:49,345 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2022-11-19 08:33:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:33:49,345 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2022-11-19 08:33:49,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:33:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2022-11-19 08:33:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 08:33:49,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:33:49,346 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 08:33:49,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-19 08:33:49,346 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:33:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:33:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash -876664415, now seen corresponding path program 1 times [2022-11-19 08:33:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:33:49,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866273950] [2022-11-19 08:33:49,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:33:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:33:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:33:49,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:33:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:33:49,470 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:33:49,470 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:33:49,471 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 08:33:49,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 08:33:49,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 08:33:49,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 08:33:49,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 08:33:49,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 08:33:49,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 08:33:49,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 08:33:49,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 08:33:49,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 08:33:49,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 08:33:49,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 08:33:49,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 08:33:49,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-19 08:33:49,478 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:33:49,483 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:33:49,483 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:33:49,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:33:49 BasicIcfg [2022-11-19 08:33:49,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:33:49,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:33:49,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:33:49,538 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:33:49,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:33:28" (3/4) ... [2022-11-19 08:33:49,542 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:33:49,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:33:49,542 INFO L158 Benchmark]: Toolchain (without parser) took 22660.92ms. Allocated memory was 109.1MB in the beginning and 446.7MB in the end (delta: 337.6MB). Free memory was 68.2MB in the beginning and 285.6MB in the end (delta: -217.3MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2022-11-19 08:33:49,543 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 109.1MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:33:49,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.73ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 70.7MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 08:33:49,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.00ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 68.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:33:49,544 INFO L158 Benchmark]: Boogie Preprocessor took 65.21ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 66.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:33:49,544 INFO L158 Benchmark]: RCFGBuilder took 881.54ms. Allocated memory was 109.1MB in the beginning and 146.8MB in the end (delta: 37.7MB). Free memory was 66.2MB in the beginning and 111.3MB in the end (delta: -45.1MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2022-11-19 08:33:49,544 INFO L158 Benchmark]: TraceAbstraction took 20984.03ms. Allocated memory was 146.8MB in the beginning and 446.7MB in the end (delta: 299.9MB). Free memory was 110.5MB in the beginning and 285.6MB in the end (delta: -175.0MB). Peak memory consumption was 124.6MB. Max. memory is 16.1GB. [2022-11-19 08:33:49,545 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 446.7MB. Free memory is still 285.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:33:49,546 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.27ms. Allocated memory is still 109.1MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 629.73ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 70.7MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.00ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 68.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.21ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 66.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 881.54ms. Allocated memory was 109.1MB in the beginning and 146.8MB in the end (delta: 37.7MB). Free memory was 66.2MB in the beginning and 111.3MB in the end (delta: -45.1MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20984.03ms. Allocated memory was 146.8MB in the beginning and 446.7MB in the end (delta: 299.9MB). Free memory was 110.5MB in the beginning and 285.6MB in the end (delta: -175.0MB). Peak memory consumption was 124.6MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 446.7MB. Free memory is still 285.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 131 PlacesBefore, 44 PlacesAfterwards, 123 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 6017 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2840, independent: 2666, independent conditional: 0, independent unconditional: 2666, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1606, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1606, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 608, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 567, dependent conditional: 0, dependent unconditional: 567, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2840, independent: 1119, independent conditional: 0, independent unconditional: 1119, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1606, unknown conditional: 0, unknown unconditional: 1606] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool weak$$choice0; [L732] 0 int z$w_buff1; [L735] 0 _Bool weak$$choice2; [L718] 0 _Bool z$flush_delayed; [L730] 0 int z$w_buff0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L720] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd3; [L719] 0 int z$mem_tmp; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L733] 0 _Bool z$w_buff1_used; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 _Bool main$tmp_guard1; [L710] 0 _Bool main$tmp_guard0; [L731] 0 _Bool z$w_buff0_used; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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 [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 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) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1592 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 94 mSDtfsCounter, 1592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1197 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 3064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 08:33:49,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- 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 08:33:51,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:33:51,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:33:51,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:33:51,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:33:51,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:33:51,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:33:51,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:33:51,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:33:51,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:33:51,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:33:51,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:33:51,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:33:51,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:33:51,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:33:51,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:33:51,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:33:51,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:33:51,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:33:51,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:33:51,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:33:51,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:33:51,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:33:51,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:33:51,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:33:51,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:33:51,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:33:51,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:33:51,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:33:51,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:33:51,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:33:51,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:33:51,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:33:51,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:33:51,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:33:51,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:33:51,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:33:51,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:33:51,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:33:51,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:33:51,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:33:51,987 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 08:33:52,042 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:33:52,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:33:52,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:33:52,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:33:52,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:33:52,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:33:52,047 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:33:52,047 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:33:52,047 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:33:52,047 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:33:52,048 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:33:52,049 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:33:52,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 08:33:52,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 08:33:52,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:33:52,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:33:52,051 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 08:33:52,051 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:33:52,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:33:52,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:33:52,052 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 08:33:52,052 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 08:33:52,052 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 08:33:52,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:33:52,053 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:33:52,053 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:33:52,054 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:33:52,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:33:52,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:33:52,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:33:52,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:33:52,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:33:52,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:33:52,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:33:52,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:33:52,056 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:33:52,056 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:33:52,056 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:33:52,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:33:52,057 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_245b3324-a14f-486f-9282-6acd58bca77b/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_245b3324-a14f-486f-9282-6acd58bca77b/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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-11-19 08:33:52,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:33:52,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:33:52,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:33:52,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:33:52,427 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:33:52,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 08:33:52,491 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/aac9ed7c5/d1e37dd3e7324010a7eaac08f27c50cc/FLAG208962273 [2022-11-19 08:33:53,072 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:33:53,073 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 08:33:53,093 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/aac9ed7c5/d1e37dd3e7324010a7eaac08f27c50cc/FLAG208962273 [2022-11-19 08:33:53,333 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/data/aac9ed7c5/d1e37dd3e7324010a7eaac08f27c50cc [2022-11-19 08:33:53,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:33:53,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:33:53,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:33:53,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:33:53,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:33:53,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:33:53" (1/1) ... [2022-11-19 08:33:53,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3911d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:53, skipping insertion in model container [2022-11-19 08:33:53,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:33:53" (1/1) ... [2022-11-19 08:33:53,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:33:53,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:33:53,608 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_245b3324-a14f-486f-9282-6acd58bca77b/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-19 08:33:53,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:33:53,917 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:33:53,935 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_245b3324-a14f-486f-9282-6acd58bca77b/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-11-19 08:33:54,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:33:54,069 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:33:54,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54 WrapperNode [2022-11-19 08:33:54,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:33:54,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:33:54,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:33:54,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:33:54,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,162 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-19 08:33:54,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:33:54,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:33:54,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:33:54,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:33:54,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:33:54,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:33:54,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:33:54,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:33:54,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (1/1) ... [2022-11-19 08:33:54,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:33:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:33:54,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:33:54,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:33:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:33:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:33:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:33:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:33:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 08:33:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:33:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 08:33:54,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 08:33:54,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 08:33:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 08:33:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 08:33:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 08:33:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:33:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:33:54,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:33:54,333 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 08:33:54,583 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:33:54,585 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:33:54,946 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:33:55,230 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:33:55,230 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:33:55,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:33:55 BoogieIcfgContainer [2022-11-19 08:33:55,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:33:55,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:33:55,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:33:55,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:33:55,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:33:53" (1/3) ... [2022-11-19 08:33:55,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532149fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:33:55, skipping insertion in model container [2022-11-19 08:33:55,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:33:54" (2/3) ... [2022-11-19 08:33:55,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532149fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:33:55, skipping insertion in model container [2022-11-19 08:33:55,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:33:55" (3/3) ... [2022-11-19 08:33:55,242 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 08:33:55,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:33:55,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 08:33:55,263 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:33:55,350 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:33:55,389 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:33:55,405 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-19 08:33:55,408 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-19 08:33:55,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-19 08:33:55,466 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-19 08:33:55,466 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:33:55,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-19 08:33:55,474 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-19 08:34:05,711 INFO L134 LiptonReduction]: Checked pairs total: 5957 [2022-11-19 08:34:05,711 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-19 08:34:05,721 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-19 08:34:05,830 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states 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 08:34:05,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:34:05,867 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;@aae3d38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:34:05,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 08:34:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states 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 08:34:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 08:34:05,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:05,878 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 08:34:05,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:05,888 INFO L85 PathProgramCache]: Analyzing trace with hash 530, now seen corresponding path program 1 times [2022-11-19 08:34:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:05,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854494752] [2022-11-19 08:34:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:05,901 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 08:34:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:05,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:05,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:06,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 08:34:06,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:06,012 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 08:34:06,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:06,013 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:06,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854494752] [2022-11-19 08:34:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854494752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:06,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:06,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 08:34:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942779786] [2022-11-19 08:34:06,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:06,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:34:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:34:06,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:34:06,050 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 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 08:34:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:06,297 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2022-11-19 08:34:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:34:06,312 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 08:34:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:06,358 INFO L225 Difference]: With dead ends: 1024 [2022-11-19 08:34:06,358 INFO L226 Difference]: Without dead ends: 1024 [2022-11-19 08:34:06,359 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 08:34:06,363 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:06,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:34:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-11-19 08:34:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2022-11-19 08:34:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states 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 08:34:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2022-11-19 08:34:06,526 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2022-11-19 08:34:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:06,527 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2022-11-19 08:34:06,527 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 08:34:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2022-11-19 08:34:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 08:34:06,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:06,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 08:34:06,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:06,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:06,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash 520639, now seen corresponding path program 1 times [2022-11-19 08:34:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:06,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778291305] [2022-11-19 08:34:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:06,747 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 08:34:06,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:06,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:06,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:06,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:34:06,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:06,870 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 08:34:06,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:06,871 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:06,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778291305] [2022-11-19 08:34:06,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778291305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:06,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:06,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:34:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127307378] [2022-11-19 08:34:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:06,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:34:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:06,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:34:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:34:06,878 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:34:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:06,982 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2022-11-19 08:34:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:34:06,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 08:34:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:06,990 INFO L225 Difference]: With dead ends: 837 [2022-11-19 08:34:06,990 INFO L226 Difference]: Without dead ends: 812 [2022-11-19 08:34:06,990 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 08:34:06,991 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:06,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:34:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-19 08:34:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-19 08:34:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states 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 08:34:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-19 08:34:07,038 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2022-11-19 08:34:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:07,039 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-19 08:34:07,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:34:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-19 08:34:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 08:34:07,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:07,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:07,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -161981923, now seen corresponding path program 1 times [2022-11-19 08:34:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:07,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875723305] [2022-11-19 08:34:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:07,256 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 08:34:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:07,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:07,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:34:07,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:07,427 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 08:34:07,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:07,428 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875723305] [2022-11-19 08:34:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875723305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:07,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:07,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:34:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020413596] [2022-11-19 08:34:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:07,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:34:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:34:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:34:07,431 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:34:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:07,571 INFO L93 Difference]: Finished difference Result 617 states and 1659 transitions. [2022-11-19 08:34:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:34:07,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-19 08:34:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:07,575 INFO L225 Difference]: With dead ends: 617 [2022-11-19 08:34:07,575 INFO L226 Difference]: Without dead ends: 492 [2022-11-19 08:34:07,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 08:34:07,578 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:07,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:34:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-19 08:34:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2022-11-19 08:34:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 490 states have (on average 2.642857142857143) internal successors, (1295), 491 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states 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 08:34:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1295 transitions. [2022-11-19 08:34:07,600 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1295 transitions. Word has length 10 [2022-11-19 08:34:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:07,601 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1295 transitions. [2022-11-19 08:34:07,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:34:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1295 transitions. [2022-11-19 08:34:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:34:07,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:07,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:07,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:07,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1081620639, now seen corresponding path program 1 times [2022-11-19 08:34:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:07,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718802682] [2022-11-19 08:34:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:07,823 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 08:34:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:07,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:07,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 08:34:07,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:08,000 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 08:34:08,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:08,000 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:08,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718802682] [2022-11-19 08:34:08,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718802682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:08,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:08,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:34:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477726762] [2022-11-19 08:34:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:08,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:34:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:34:08,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:08,003 INFO L87 Difference]: Start difference. First operand 492 states and 1295 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 08:34:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:08,196 INFO L93 Difference]: Finished difference Result 313 states and 731 transitions. [2022-11-19 08:34:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:34:08,197 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 08:34:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:08,198 INFO L225 Difference]: With dead ends: 313 [2022-11-19 08:34:08,198 INFO L226 Difference]: Without dead ends: 252 [2022-11-19 08:34:08,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:34:08,200 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:08,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 15 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:34:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-19 08:34:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-19 08:34:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 250 states have (on average 2.3) internal successors, (575), 251 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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 08:34:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 575 transitions. [2022-11-19 08:34:08,214 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 575 transitions. Word has length 14 [2022-11-19 08:34:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:08,215 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 575 transitions. [2022-11-19 08:34:08,215 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 08:34:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 575 transitions. [2022-11-19 08:34:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 08:34:08,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:08,217 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 08:34:08,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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)] Ended with exit code 0 [2022-11-19 08:34:08,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:08,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1452190831, now seen corresponding path program 1 times [2022-11-19 08:34:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:08,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768775302] [2022-11-19 08:34:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:08,430 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 08:34:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:08,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:08,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:08,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 08:34:08,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:08,673 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 08:34:08,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:08,674 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:08,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768775302] [2022-11-19 08:34:08,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768775302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:08,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:08,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:34:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804103611] [2022-11-19 08:34:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:08,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:34:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:34:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:34:08,676 INFO L87 Difference]: Start difference. First operand 252 states and 575 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:34:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:08,896 INFO L93 Difference]: Finished difference Result 205 states and 479 transitions. [2022-11-19 08:34:08,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:34:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 08:34:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:08,897 INFO L225 Difference]: With dead ends: 205 [2022-11-19 08:34:08,898 INFO L226 Difference]: Without dead ends: 192 [2022-11-19 08:34:08,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:34:08,898 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:08,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 27 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:34:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-19 08:34:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-19 08:34:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.3947368421052633) internal successors, (455), 191 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 08:34:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 455 transitions. [2022-11-19 08:34:08,905 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 455 transitions. Word has length 18 [2022-11-19 08:34:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:08,905 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 455 transitions. [2022-11-19 08:34:08,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:34:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 455 transitions. [2022-11-19 08:34:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:08,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:08,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:08,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:09,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1716290577, now seen corresponding path program 1 times [2022-11-19 08:34:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:09,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855796841] [2022-11-19 08:34:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:09,130 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 08:34:09,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:09,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:09,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:34:09,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:09,656 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 08:34:09,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:09,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:09,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855796841] [2022-11-19 08:34:09,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855796841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:09,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:09,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:34:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097606096] [2022-11-19 08:34:09,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:09,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:34:09,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:34:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:09,659 INFO L87 Difference]: Start difference. First operand 192 states and 455 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:09,742 INFO L93 Difference]: Finished difference Result 315 states and 745 transitions. [2022-11-19 08:34:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:34:09,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 08:34:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:09,744 INFO L225 Difference]: With dead ends: 315 [2022-11-19 08:34:09,745 INFO L226 Difference]: Without dead ends: 315 [2022-11-19 08:34:09,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:09,745 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:09,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-11-19 08:34:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-19 08:34:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 225. [2022-11-19 08:34:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 223 states have (on average 2.2780269058295963) internal successors, (508), 224 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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 08:34:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 508 transitions. [2022-11-19 08:34:09,754 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 508 transitions. Word has length 22 [2022-11-19 08:34:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:09,754 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 508 transitions. [2022-11-19 08:34:09,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 508 transitions. [2022-11-19 08:34:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:09,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:09,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:09,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1716290557, now seen corresponding path program 1 times [2022-11-19 08:34:09,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:09,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642549055] [2022-11-19 08:34:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:34:09,977 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 08:34:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:09,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:09,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:34:10,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 08:34:10,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:10,216 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 08:34:10,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:10,217 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642549055] [2022-11-19 08:34:10,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642549055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:10,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:10,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:34:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282956364] [2022-11-19 08:34:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:10,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:34:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:34:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:34:10,219 INFO L87 Difference]: Start difference. First operand 225 states and 508 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:10,345 INFO L93 Difference]: Finished difference Result 304 states and 665 transitions. [2022-11-19 08:34:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:34:10,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 08:34:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:10,348 INFO L225 Difference]: With dead ends: 304 [2022-11-19 08:34:10,348 INFO L226 Difference]: Without dead ends: 281 [2022-11-19 08:34:10,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 08:34:10,348 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:10,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:34:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-19 08:34:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2022-11-19 08:34:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 278 states have (on average 2.262589928057554) internal successors, (629), 279 states have internal predecessors, (629), 0 states have call successors, (0), 0 states 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 08:34:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 629 transitions. [2022-11-19 08:34:10,357 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 629 transitions. Word has length 22 [2022-11-19 08:34:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:10,358 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 629 transitions. [2022-11-19 08:34:10,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 629 transitions. [2022-11-19 08:34:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:10,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:10,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:10,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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)] Ended with exit code 0 [2022-11-19 08:34:10,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:10,571 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2091280161, now seen corresponding path program 2 times [2022-11-19 08:34:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:10,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281158152] [2022-11-19 08:34:10,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:34:10,572 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 08:34:10,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:10,573 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:10,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:10,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:34:10,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:34:10,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 08:34:10,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:11,114 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 08:34:11,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:11,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:11,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281158152] [2022-11-19 08:34:11,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281158152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:11,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:11,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:34:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080783494] [2022-11-19 08:34:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:11,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:34:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:34:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:34:11,117 INFO L87 Difference]: Start difference. First operand 280 states and 629 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:11,410 INFO L93 Difference]: Finished difference Result 356 states and 765 transitions. [2022-11-19 08:34:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:34:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 08:34:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:11,413 INFO L225 Difference]: With dead ends: 356 [2022-11-19 08:34:11,413 INFO L226 Difference]: Without dead ends: 339 [2022-11-19 08:34:11,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:34:11,414 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:11,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 27 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:34:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-19 08:34:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-11-19 08:34:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 266 states have (on average 2.2669172932330826) internal successors, (603), 267 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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 08:34:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 603 transitions. [2022-11-19 08:34:11,424 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 603 transitions. Word has length 22 [2022-11-19 08:34:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:11,425 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 603 transitions. [2022-11-19 08:34:11,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 603 transitions. [2022-11-19 08:34:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:11,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:11,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:11,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:11,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:11,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2022562115, now seen corresponding path program 3 times [2022-11-19 08:34:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:11,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750335631] [2022-11-19 08:34:11,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:34:11,640 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 08:34:11,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:11,641 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:11,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:11,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:34:11,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:34:11,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-19 08:34:11,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:12,262 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 08:34:12,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:12,262 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:12,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750335631] [2022-11-19 08:34:12,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750335631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:12,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:12,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:34:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085656617] [2022-11-19 08:34:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:12,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:34:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:34:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:34:12,265 INFO L87 Difference]: Start difference. First operand 268 states and 603 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:12,515 INFO L93 Difference]: Finished difference Result 323 states and 702 transitions. [2022-11-19 08:34:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:34:12,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 08:34:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:12,517 INFO L225 Difference]: With dead ends: 323 [2022-11-19 08:34:12,517 INFO L226 Difference]: Without dead ends: 299 [2022-11-19 08:34:12,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-19 08:34:12,518 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:12,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:34:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-19 08:34:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 242. [2022-11-19 08:34:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 2.3375) internal successors, (561), 241 states have internal predecessors, (561), 0 states have call successors, (0), 0 states 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 08:34:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 561 transitions. [2022-11-19 08:34:12,536 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 561 transitions. Word has length 22 [2022-11-19 08:34:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:12,537 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 561 transitions. [2022-11-19 08:34:12,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 561 transitions. [2022-11-19 08:34:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:12,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:12,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:12,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:12,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:12,750 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash -64064177, now seen corresponding path program 2 times [2022-11-19 08:34:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:12,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101911161] [2022-11-19 08:34:12,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:34:12,751 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 08:34:12,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:12,752 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:12,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:12,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 08:34:12,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:34:12,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:34:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:13,221 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 08:34:13,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:13,221 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:13,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101911161] [2022-11-19 08:34:13,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101911161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:13,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:13,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:34:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204278050] [2022-11-19 08:34:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:34:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:34:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:13,223 INFO L87 Difference]: Start difference. First operand 242 states and 561 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:13,309 INFO L93 Difference]: Finished difference Result 389 states and 908 transitions. [2022-11-19 08:34:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:34:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 08:34:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:13,312 INFO L225 Difference]: With dead ends: 389 [2022-11-19 08:34:13,312 INFO L226 Difference]: Without dead ends: 319 [2022-11-19 08:34:13,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:13,313 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:13,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-19 08:34:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-19 08:34:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 235. [2022-11-19 08:34:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 233 states have (on average 2.3304721030042916) internal successors, (543), 234 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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 08:34:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 543 transitions. [2022-11-19 08:34:13,321 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 543 transitions. Word has length 22 [2022-11-19 08:34:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:13,321 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 543 transitions. [2022-11-19 08:34:13,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 543 transitions. [2022-11-19 08:34:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:13,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:13,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:13,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:13,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:13,536 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 873174865, now seen corresponding path program 3 times [2022-11-19 08:34:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:13,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526093940] [2022-11-19 08:34:13,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 08:34:13,537 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 08:34:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:13,538 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:13,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 (12)] Waiting until timeout for monitored process [2022-11-19 08:34:13,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 08:34:13,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:34:13,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 08:34:13,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:34:14,057 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 08:34:14,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:34:14,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:34:14,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526093940] [2022-11-19 08:34:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526093940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:34:14,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:34:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:34:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838088028] [2022-11-19 08:34:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:34:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:34:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:34:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:34:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:14,059 INFO L87 Difference]: Start difference. First operand 235 states and 543 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:34:14,121 INFO L93 Difference]: Finished difference Result 403 states and 927 transitions. [2022-11-19 08:34:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:34:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-19 08:34:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:34:14,124 INFO L225 Difference]: With dead ends: 403 [2022-11-19 08:34:14,124 INFO L226 Difference]: Without dead ends: 300 [2022-11-19 08:34:14,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:34:14,124 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:34:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-11-19 08:34:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-19 08:34:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-11-19 08:34:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 298 states have (on average 2.271812080536913) internal successors, (677), 299 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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 08:34:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 677 transitions. [2022-11-19 08:34:14,134 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 677 transitions. Word has length 22 [2022-11-19 08:34:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:34:14,134 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 677 transitions. [2022-11-19 08:34:14,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 08:34:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 677 transitions. [2022-11-19 08:34:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 08:34:14,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:34:14,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:34:14,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 (12)] Forceful destruction successful, exit code 0 [2022-11-19 08:34:14,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:14,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 08:34:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:34:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1560748211, now seen corresponding path program 4 times [2022-11-19 08:34:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:34:14,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571745728] [2022-11-19 08:34:14,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 08:34:14,351 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 08:34:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:34:14,352 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:14,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 (13)] Waiting until timeout for monitored process [2022-11-19 08:34:14,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 08:34:14,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 08:34:14,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:34:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:34:14,635 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 08:34:14,635 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:34:14,636 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 08:34:14,638 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 08:34:14,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 08:34:14,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 08:34:14,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 08:34:14,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 08:34:14,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 08:34:14,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 08:34:14,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 08:34:14,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 08:34:14,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 08:34:14,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 08:34:14,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 08:34:14,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 (13)] Forceful destruction successful, exit code 0 [2022-11-19 08:34:14,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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 08:34:14,851 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-11-19 08:34:14,855 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:34:14,856 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:34:14,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:34:14 BasicIcfg [2022-11-19 08:34:14,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:34:14,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:34:14,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:34:14,965 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:34:14,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:33:55" (3/4) ... [2022-11-19 08:34:14,968 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:34:14,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:34:14,971 INFO L158 Benchmark]: Toolchain (without parser) took 21635.09ms. Allocated memory was 73.4MB in the beginning and 125.8MB in the end (delta: 52.4MB). Free memory was 54.1MB in the beginning and 47.5MB in the end (delta: 6.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2022-11-19 08:34:14,971 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 73.4MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:34:14,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.44ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 43.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:34:14,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.02ms. Allocated memory is still 73.4MB. Free memory was 43.4MB in the beginning and 40.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:34:14,972 INFO L158 Benchmark]: Boogie Preprocessor took 68.53ms. Allocated memory is still 73.4MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:34:14,973 INFO L158 Benchmark]: RCFGBuilder took 1000.06ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 38.6MB in the beginning and 73.6MB in the end (delta: -35.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-11-19 08:34:14,974 INFO L158 Benchmark]: TraceAbstraction took 19728.97ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.0MB in the beginning and 47.5MB in the end (delta: 25.5MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2022-11-19 08:34:14,974 INFO L158 Benchmark]: Witness Printer took 5.81ms. Allocated memory is still 125.8MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:34:14,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 73.4MB. Free memory was 54.5MB in the beginning and 54.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.44ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 43.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.02ms. Allocated memory is still 73.4MB. Free memory was 43.4MB in the beginning and 40.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.53ms. Allocated memory is still 73.4MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1000.06ms. Allocated memory was 73.4MB in the beginning and 104.9MB in the end (delta: 31.5MB). Free memory was 38.6MB in the beginning and 73.6MB in the end (delta: -35.1MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19728.97ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.0MB in the beginning and 47.5MB in the end (delta: 25.5MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * Witness Printer took 5.81ms. Allocated memory is still 125.8MB. Free memory is still 47.5MB. 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: 10.3s, 132 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 5957 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2534, independent: 2371, independent conditional: 0, independent unconditional: 2371, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1479, independent: 1440, independent conditional: 0, independent unconditional: 1440, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1479, independent: 1422, independent conditional: 0, independent unconditional: 1422, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 443, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 407, dependent conditional: 0, dependent unconditional: 407, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2534, independent: 931, independent conditional: 0, independent unconditional: 931, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 1479, unknown conditional: 0, unknown unconditional: 1479] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool weak$$choice0; [L732] 0 int z$w_buff1; [L735] 0 _Bool weak$$choice2; [L718] 0 _Bool z$flush_delayed; [L730] 0 int z$w_buff0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L720] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd3; [L719] 0 int z$mem_tmp; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L733] 0 _Bool z$w_buff1_used; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 _Bool main$tmp_guard1; [L710] 0 _Bool main$tmp_guard0; [L731] 0 _Bool z$w_buff0_used; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=0, t2489={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=1, t2489={3:0}, t2490={7: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=2, t2489={3:0}, t2490={7:0}, t2491={15: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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 [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={3:0}, t2490={7:0}, t2491={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 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) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 326 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 860 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 59 mSDtfsCounter, 860 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 303 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 167 ConstructedInterpolants, 42 QuantifiedInterpolants, 2761 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1487 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 08:34:15,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_245b3324-a14f-486f-9282-6acd58bca77b/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