./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- 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-2329fc7 [2022-12-13 16:09:41,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:09:41,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:09:41,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:09:41,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:09:41,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:09:41,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:09:41,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:09:41,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:09:41,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:09:41,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:09:41,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:09:41,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:09:41,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:09:41,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:09:41,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:09:41,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:09:41,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:09:41,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:09:41,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:09:41,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:09:41,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:09:41,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:09:41,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:09:41,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:09:41,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:09:41,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:09:41,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:09:41,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:09:41,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:09:41,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:09:41,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:09:41,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:09:41,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:09:41,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:09:41,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:09:41,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:09:41,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:09:41,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:09:41,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:09:41,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:09:41,677 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:09:41,693 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:09:41,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:09:41,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:09:41,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:09:41,694 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:09:41,694 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:09:41,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:09:41,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:09:41,695 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:09:41,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:09:41,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:09:41,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:09:41,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:09:41,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:09:41,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:09:41,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:09:41,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:09:41,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:09:41,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:09:41,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:09:41,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:09:41,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:09:41,698 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:09:41,698 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:09:41,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:09:41,698 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:09:41,704 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2022-12-13 16:09:41,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:09:41,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:09:41,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:09:41,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:09:41,914 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:09:41,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-12-13 16:09:44,489 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:09:44,682 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:09:44,682 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-12-13 16:09:44,691 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data/3f8ce11d7/c89a08712cbf424a8e8d6033a275b83f/FLAG3eb5821bc [2022-12-13 16:09:45,069 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data/3f8ce11d7/c89a08712cbf424a8e8d6033a275b83f [2022-12-13 16:09:45,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:09:45,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:09:45,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:09:45,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:09:45,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:09:45,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c03e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45, skipping insertion in model container [2022-12-13 16:09:45,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:09:45,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:09:45,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-13 16:09:45,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:09:45,357 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:09:45,366 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-13 16:09:45,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:09:45,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:09:45,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:09:45,426 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:09:45,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45 WrapperNode [2022-12-13 16:09:45,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:09:45,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:09:45,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:09:45,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:09:45,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,464 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 16:09:45,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:09:45,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:09:45,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:09:45,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:09:45,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:09:45,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:09:45,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:09:45,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:09:45,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (1/1) ... [2022-12-13 16:09:45,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:09:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:09:45,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:09:45,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:09:45,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:09:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:09:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:09:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:09:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:09:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:09:45,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:09:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:09:45,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:09:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:09:45,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:09:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:09:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:09:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:09:45,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:09:45,552 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:09:45,667 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:09:45,669 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:09:45,945 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:09:46,034 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:09:46,034 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:09:46,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:09:46 BoogieIcfgContainer [2022-12-13 16:09:46,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:09:46,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:09:46,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:09:46,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:09:46,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:09:45" (1/3) ... [2022-12-13 16:09:46,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cf5ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:09:46, skipping insertion in model container [2022-12-13 16:09:46,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:09:45" (2/3) ... [2022-12-13 16:09:46,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cf5ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:09:46, skipping insertion in model container [2022-12-13 16:09:46,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:09:46" (3/3) ... [2022-12-13 16:09:46,044 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-12-13 16:09:46,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:09:46,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 16:09:46,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:09:46,103 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:09:46,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 16:09:46,169 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 16:09:46,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:09:46,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:09:46,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 16:09:46,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-13 16:09:46,179 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:09:46,187 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 16:09:46,189 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 16:09:46,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-13 16:09:46,222 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 16:09:46,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:09:46,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:09:46,225 INFO L119 LiptonReduction]: Number of co-enabled transitions 2404 [2022-12-13 16:09:50,843 INFO L134 LiptonReduction]: Checked pairs total: 6177 [2022-12-13 16:09:50,843 INFO L136 LiptonReduction]: Total number of compositions: 122 [2022-12-13 16:09:50,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:09:50,858 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=PETRI_NET, 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;@59f276b3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:09:50,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 16:09:50,859 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:09:50,859 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:09:50,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:50,860 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:09:50,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2022-12-13 16:09:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:50,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392238635] [2022-12-13 16:09:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:50,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392238635] [2022-12-13 16:09:50,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392238635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:50,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:50,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:09:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255435466] [2022-12-13 16:09:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:50,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:09:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:09:50,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:09:50,970 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 249 [2022-12-13 16:09:50,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:50,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:50,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 249 [2022-12-13 16:09:50,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:51,245 INFO L130 PetriNetUnfolder]: 1093/1694 cut-off events. [2022-12-13 16:09:51,245 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 16:09:51,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1694 events. 1093/1694 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8326 event pairs, 1093 based on Foata normal form. 0/1350 useless extension candidates. Maximal degree in co-relation 3360. Up to 1623 conditions per place. [2022-12-13 16:09:51,254 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-13 16:09:51,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2022-12-13 16:09:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:09:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:09:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2022-12-13 16:09:51,264 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5120481927710844 [2022-12-13 16:09:51,265 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2022-12-13 16:09:51,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2022-12-13 16:09:51,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:51,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2022-12-13 16:09:51,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,273 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,274 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 2 states and 255 transitions. [2022-12-13 16:09:51,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2022-12-13 16:09:51,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:09:51,277 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-12-13 16:09:51,279 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 16:09:51,281 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-12-13 16:09:51,282 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-12-13 16:09:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:51,282 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:09:51,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:09:51,282 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 512689650, now seen corresponding path program 1 times [2022-12-13 16:09:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:51,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223597861] [2022-12-13 16:09:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223597861] [2022-12-13 16:09:51,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223597861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:51,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:51,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:09:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704962665] [2022-12-13 16:09:51,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:09:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:09:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:09:51,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 249 [2022-12-13 16:09:51,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:51,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 249 [2022-12-13 16:09:51,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:51,781 INFO L130 PetriNetUnfolder]: 855/1354 cut-off events. [2022-12-13 16:09:51,781 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:09:51,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1354 events. 855/1354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6584 event pairs, 237 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 2676. Up to 1027 conditions per place. [2022-12-13 16:09:51,789 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2022-12-13 16:09:51,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 148 flow [2022-12-13 16:09:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:09:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:09:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-12-13 16:09:51,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.499330655957162 [2022-12-13 16:09:51,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2022-12-13 16:09:51,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2022-12-13 16:09:51,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:51,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2022-12-13 16:09:51,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,795 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 373 transitions. [2022-12-13 16:09:51,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 148 flow [2022-12-13 16:09:51,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:09:51,796 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-12-13 16:09:51,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 16:09:51,797 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 16:09:51,797 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-12-13 16:09:51,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:51,797 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:51,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:09:51,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1766589397, now seen corresponding path program 1 times [2022-12-13 16:09:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:51,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533640325] [2022-12-13 16:09:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:51,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533640325] [2022-12-13 16:09:51,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533640325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:51,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:51,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:09:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351510617] [2022-12-13 16:09:51,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:51,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:09:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:51,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:09:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:09:51,979 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 249 [2022-12-13 16:09:51,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:51,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:51,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 249 [2022-12-13 16:09:51,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:52,154 INFO L130 PetriNetUnfolder]: 815/1293 cut-off events. [2022-12-13 16:09:52,154 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-13 16:09:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 1293 events. 815/1293 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6012 event pairs, 311 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 2660. Up to 777 conditions per place. [2022-12-13 16:09:52,159 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-13 16:09:52,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 134 flow [2022-12-13 16:09:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:09:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:09:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-12-13 16:09:52,162 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4899598393574297 [2022-12-13 16:09:52,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-12-13 16:09:52,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-12-13 16:09:52,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:52,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-12-13 16:09:52,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,167 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 366 transitions. [2022-12-13 16:09:52,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 134 flow [2022-12-13 16:09:52,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:09:52,169 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2022-12-13 16:09:52,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 16:09:52,169 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 16:09:52,170 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 60 flow [2022-12-13 16:09:52,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,170 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:52,170 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:09:52,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1766589376, now seen corresponding path program 1 times [2022-12-13 16:09:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448278166] [2022-12-13 16:09:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:52,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:52,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448278166] [2022-12-13 16:09:52,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448278166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:52,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:52,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801351027] [2022-12-13 16:09:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:52,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:52,592 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 249 [2022-12-13 16:09:52,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:52,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 249 [2022-12-13 16:09:52,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:52,806 INFO L130 PetriNetUnfolder]: 735/1163 cut-off events. [2022-12-13 16:09:52,806 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-13 16:09:52,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2467 conditions, 1163 events. 735/1163 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5269 event pairs, 152 based on Foata normal form. 32/1195 useless extension candidates. Maximal degree in co-relation 2462. Up to 761 conditions per place. [2022-12-13 16:09:52,810 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-13 16:09:52,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 168 flow [2022-12-13 16:09:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:09:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:09:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-12-13 16:09:52,812 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4321285140562249 [2022-12-13 16:09:52,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2022-12-13 16:09:52,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2022-12-13 16:09:52,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:52,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2022-12-13 16:09:52,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,815 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,815 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 60 flow. Second operand 5 states and 538 transitions. [2022-12-13 16:09:52,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 168 flow [2022-12-13 16:09:52,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:09:52,817 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 68 flow [2022-12-13 16:09:52,817 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-13 16:09:52,817 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2022-12-13 16:09:52,818 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 68 flow [2022-12-13 16:09:52,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:52,818 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:52,818 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:52,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:09:52,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1181778883, now seen corresponding path program 1 times [2022-12-13 16:09:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:52,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147201429] [2022-12-13 16:09:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:53,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147201429] [2022-12-13 16:09:53,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147201429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:53,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:53,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957688683] [2022-12-13 16:09:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:53,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:53,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:53,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:53,122 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-12-13 16:09:53,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:53,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:53,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-12-13 16:09:53,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:53,289 INFO L130 PetriNetUnfolder]: 527/844 cut-off events. [2022-12-13 16:09:53,289 INFO L131 PetriNetUnfolder]: For 111/127 co-relation queries the response was YES. [2022-12-13 16:09:53,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 844 events. 527/844 cut-off events. For 111/127 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3678 event pairs, 256 based on Foata normal form. 48/876 useless extension candidates. Maximal degree in co-relation 1811. Up to 768 conditions per place. [2022-12-13 16:09:53,292 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 24 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 16:09:53,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 136 flow [2022-12-13 16:09:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:09:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:09:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2022-12-13 16:09:53,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42008032128514056 [2022-12-13 16:09:53,294 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2022-12-13 16:09:53,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2022-12-13 16:09:53,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:53,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2022-12-13 16:09:53,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:53,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:53,297 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:53,297 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 68 flow. Second operand 5 states and 523 transitions. [2022-12-13 16:09:53,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 136 flow [2022-12-13 16:09:53,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 16:09:53,298 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 60 flow [2022-12-13 16:09:53,298 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-13 16:09:53,299 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2022-12-13 16:09:53,299 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 60 flow [2022-12-13 16:09:53,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:53,300 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:53,300 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:53,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:09:53,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:53,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1181778904, now seen corresponding path program 1 times [2022-12-13 16:09:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:53,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237515304] [2022-12-13 16:09:53,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:53,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:53,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237515304] [2022-12-13 16:09:53,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237515304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:53,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:53,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605832437] [2022-12-13 16:09:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:53,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:53,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:53,765 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 249 [2022-12-13 16:09:53,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:53,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:53,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 249 [2022-12-13 16:09:53,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:54,079 INFO L130 PetriNetUnfolder]: 1280/1897 cut-off events. [2022-12-13 16:09:54,079 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 16:09:54,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 1897 events. 1280/1897 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8259 event pairs, 210 based on Foata normal form. 12/1909 useless extension candidates. Maximal degree in co-relation 4055. Up to 1774 conditions per place. [2022-12-13 16:09:54,084 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 40 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2022-12-13 16:09:54,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 230 flow [2022-12-13 16:09:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:09:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:09:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 463 transitions. [2022-12-13 16:09:54,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.464859437751004 [2022-12-13 16:09:54,086 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 463 transitions. [2022-12-13 16:09:54,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 463 transitions. [2022-12-13 16:09:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:54,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 463 transitions. [2022-12-13 16:09:54,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,088 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 60 flow. Second operand 4 states and 463 transitions. [2022-12-13 16:09:54,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 230 flow [2022-12-13 16:09:54,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:09:54,089 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 118 flow [2022-12-13 16:09:54,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2022-12-13 16:09:54,089 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2022-12-13 16:09:54,090 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 118 flow [2022-12-13 16:09:54,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,090 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:54,090 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:54,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:09:54,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:54,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2019558149, now seen corresponding path program 1 times [2022-12-13 16:09:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:54,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797421933] [2022-12-13 16:09:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:54,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797421933] [2022-12-13 16:09:54,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797421933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:54,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:54,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733787275] [2022-12-13 16:09:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:54,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:54,536 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 16:09:54,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 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-12-13 16:09:54,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:54,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 16:09:54,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:54,761 INFO L130 PetriNetUnfolder]: 924/1465 cut-off events. [2022-12-13 16:09:54,761 INFO L131 PetriNetUnfolder]: For 924/1011 co-relation queries the response was YES. [2022-12-13 16:09:54,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 1465 events. 924/1465 cut-off events. For 924/1011 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7114 event pairs, 188 based on Foata normal form. 22/1411 useless extension candidates. Maximal degree in co-relation 3911. Up to 1193 conditions per place. [2022-12-13 16:09:54,767 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 39 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2022-12-13 16:09:54,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 266 flow [2022-12-13 16:09:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:09:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:09:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2022-12-13 16:09:54,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4839357429718876 [2022-12-13 16:09:54,769 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2022-12-13 16:09:54,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2022-12-13 16:09:54,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:54,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2022-12-13 16:09:54,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,771 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,771 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 118 flow. Second operand 4 states and 482 transitions. [2022-12-13 16:09:54,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 266 flow [2022-12-13 16:09:54,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:09:54,773 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 152 flow [2022-12-13 16:09:54,773 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-13 16:09:54,774 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2022-12-13 16:09:54,774 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 152 flow [2022-12-13 16:09:54,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 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-12-13 16:09:54,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:54,774 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:54,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:09:54,774 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash -750250764, now seen corresponding path program 1 times [2022-12-13 16:09:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:54,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749808733] [2022-12-13 16:09:54,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:54,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:54,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749808733] [2022-12-13 16:09:54,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749808733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:54,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:54,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127130986] [2022-12-13 16:09:54,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:54,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:54,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2022-12-13 16:09:54,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:54,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:54,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2022-12-13 16:09:54,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:55,209 INFO L130 PetriNetUnfolder]: 911/1462 cut-off events. [2022-12-13 16:09:55,209 INFO L131 PetriNetUnfolder]: For 1567/1673 co-relation queries the response was YES. [2022-12-13 16:09:55,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 1462 events. 911/1462 cut-off events. For 1567/1673 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7121 event pairs, 167 based on Foata normal form. 28/1438 useless extension candidates. Maximal degree in co-relation 4352. Up to 1067 conditions per place. [2022-12-13 16:09:55,216 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 38 selfloop transitions, 12 changer transitions 0/55 dead transitions. [2022-12-13 16:09:55,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 330 flow [2022-12-13 16:09:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:09:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:09:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2022-12-13 16:09:55,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48895582329317266 [2022-12-13 16:09:55,219 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2022-12-13 16:09:55,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2022-12-13 16:09:55,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:55,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2022-12-13 16:09:55,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,222 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,222 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 152 flow. Second operand 4 states and 487 transitions. [2022-12-13 16:09:55,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 330 flow [2022-12-13 16:09:55,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 320 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:09:55,224 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 201 flow [2022-12-13 16:09:55,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-13 16:09:55,225 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-13 16:09:55,225 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 201 flow [2022-12-13 16:09:55,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:55,225 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:55,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:09:55,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash -818520204, now seen corresponding path program 2 times [2022-12-13 16:09:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:55,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070807894] [2022-12-13 16:09:55,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:55,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070807894] [2022-12-13 16:09:55,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070807894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:55,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:55,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573951521] [2022-12-13 16:09:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:55,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:55,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:55,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:55,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 249 [2022-12-13 16:09:55,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:55,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 249 [2022-12-13 16:09:55,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:55,764 INFO L130 PetriNetUnfolder]: 943/1502 cut-off events. [2022-12-13 16:09:55,765 INFO L131 PetriNetUnfolder]: For 2780/2892 co-relation queries the response was YES. [2022-12-13 16:09:55,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5046 conditions, 1502 events. 943/1502 cut-off events. For 2780/2892 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7314 event pairs, 190 based on Foata normal form. 34/1492 useless extension candidates. Maximal degree in co-relation 5036. Up to 1070 conditions per place. [2022-12-13 16:09:55,771 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 45 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2022-12-13 16:09:55,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 450 flow [2022-12-13 16:09:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:09:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:09:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-12-13 16:09:55,773 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4923694779116466 [2022-12-13 16:09:55,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2022-12-13 16:09:55,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2022-12-13 16:09:55,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:55,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2022-12-13 16:09:55,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,775 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 201 flow. Second operand 5 states and 613 transitions. [2022-12-13 16:09:55,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 450 flow [2022-12-13 16:09:55,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 442 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 16:09:55,778 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 304 flow [2022-12-13 16:09:55,778 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-13 16:09:55,779 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 16:09:55,779 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 304 flow [2022-12-13 16:09:55,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,779 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:55,779 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:55,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:09:55,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash 714882404, now seen corresponding path program 1 times [2022-12-13 16:09:55,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:55,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057581203] [2022-12-13 16:09:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:55,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057581203] [2022-12-13 16:09:55,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057581203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613023897] [2022-12-13 16:09:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:09:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:09:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:09:55,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 16:09:55,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:55,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:55,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 16:09:55,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:56,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([368] L749-->L756: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_99 256) 0)))) (.cse3 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)))) 0 v_~x$r_buff1_thd1~0_24)) (= v_~x$w_buff0_used~0_111 (ite .cse2 0 v_~x$w_buff0_used~0_112)) (= (ite .cse3 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x~0_63 (ite .cse2 v_~x$w_buff0~0_41 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_64))) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_64, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][53], [Black: 190#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff1~0 ~x$w_buff0~0)) (= ~x~0 1)), 161#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t515~0#1.base| 0) |ULTIMATE.start_main_~#t516~0#1.base| 0) |ULTIMATE.start_main_~#t517~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t517~0#1.base| |ULTIMATE.start_main_~#t516~0#1.base|)) (not (= |ULTIMATE.start_main_~#t517~0#1.base| |ULTIMATE.start_main_~#t515~0#1.base|)) (not (= |ULTIMATE.start_main_~#t516~0#1.base| |ULTIMATE.start_main_~#t515~0#1.base|))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 165#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 187#true, 108#L798true, Black: 175#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x~0 ~x$w_buff1~0)), 116#L756true, 106#L778true, 74#L841true, 200#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 147#(= ~__unbuffered_p2_EAX~0 0), 138#true, Black: 184#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), 163#true]) [2022-12-13 16:09:56,066 INFO L383 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 16:09:56,066 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 16:09:56,066 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 16:09:56,066 INFO L386 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 16:09:56,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([384] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~x~0_45 (ite .cse0 v_~x$w_buff0~0_31 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_46))) (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x$w_buff1_used~0_80 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_46, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][59], [Black: 190#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff1~0 ~x$w_buff0~0)) (= ~x~0 1)), 161#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t515~0#1.base| 0) |ULTIMATE.start_main_~#t516~0#1.base| 0) |ULTIMATE.start_main_~#t517~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t517~0#1.base| |ULTIMATE.start_main_~#t516~0#1.base|)) (not (= |ULTIMATE.start_main_~#t517~0#1.base| |ULTIMATE.start_main_~#t515~0#1.base|)) (not (= |ULTIMATE.start_main_~#t516~0#1.base| |ULTIMATE.start_main_~#t515~0#1.base|))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 165#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 187#true, 40#L808true, Black: 175#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x~0 ~x$w_buff1~0)), 106#L778true, 74#L841true, 200#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 147#(= ~__unbuffered_p2_EAX~0 0), 138#true, Black: 184#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), 68#L749true, 163#true]) [2022-12-13 16:09:56,113 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,113 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,113 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,113 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([368] L749-->L756: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_99 256) 0)))) (.cse3 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)))) 0 v_~x$r_buff1_thd1~0_24)) (= v_~x$w_buff0_used~0_111 (ite .cse2 0 v_~x$w_buff0_used~0_112)) (= (ite .cse3 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x~0_63 (ite .cse2 v_~x$w_buff0~0_41 (ite .cse4 v_~x$w_buff1~0_40 v_~x~0_64))) (= v_~x$w_buff1_used~0_98 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_99))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_64, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][53], [Black: 190#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (= ~x$w_buff1~0 ~x$w_buff0~0)) (= ~x~0 1)), 161#(and (= (store (store (store |#valid| |ULTIMATE.start_main_~#t515~0#1.base| 0) |ULTIMATE.start_main_~#t516~0#1.base| 0) |ULTIMATE.start_main_~#t517~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t517~0#1.base| |ULTIMATE.start_main_~#t516~0#1.base|)) (not (= |ULTIMATE.start_main_~#t517~0#1.base| |ULTIMATE.start_main_~#t515~0#1.base|)) (not (= |ULTIMATE.start_main_~#t516~0#1.base| |ULTIMATE.start_main_~#t515~0#1.base|))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, Black: 165#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), Black: 167#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 187#true, Black: 175#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x~0 ~x$w_buff1~0)), 116#L756true, 106#L778true, 74#L841true, 200#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 147#(= ~__unbuffered_p2_EAX~0 0), 138#true, 96#L801true, Black: 184#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), 163#true]) [2022-12-13 16:09:56,114 INFO L383 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,114 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,114 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,114 INFO L386 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 16:09:56,265 INFO L130 PetriNetUnfolder]: 1496/2381 cut-off events. [2022-12-13 16:09:56,266 INFO L131 PetriNetUnfolder]: For 9259/9374 co-relation queries the response was YES. [2022-12-13 16:09:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9153 conditions, 2381 events. 1496/2381 cut-off events. For 9259/9374 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12441 event pairs, 248 based on Foata normal form. 107/2437 useless extension candidates. Maximal degree in co-relation 9141. Up to 1063 conditions per place. [2022-12-13 16:09:56,278 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 63 selfloop transitions, 2 changer transitions 6/78 dead transitions. [2022-12-13 16:09:56,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 78 transitions, 666 flow [2022-12-13 16:09:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:09:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:09:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2022-12-13 16:09:56,280 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4799196787148594 [2022-12-13 16:09:56,280 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2022-12-13 16:09:56,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2022-12-13 16:09:56,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:56,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2022-12-13 16:09:56,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:56,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:56,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:56,282 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 304 flow. Second operand 4 states and 478 transitions. [2022-12-13 16:09:56,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 78 transitions, 666 flow [2022-12-13 16:09:56,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 622 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 16:09:56,288 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 298 flow [2022-12-13 16:09:56,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 16:09:56,289 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 16:09:56,289 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 298 flow [2022-12-13 16:09:56,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:56,289 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:56,290 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:56,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:09:56,290 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:56,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1215761785, now seen corresponding path program 1 times [2022-12-13 16:09:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:56,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152191238] [2022-12-13 16:09:56,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:56,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:56,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152191238] [2022-12-13 16:09:56,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152191238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:56,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:56,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:09:56,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039287228] [2022-12-13 16:09:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:56,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:09:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:09:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:09:56,688 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2022-12-13 16:09:56,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:56,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:56,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2022-12-13 16:09:56,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:57,056 INFO L130 PetriNetUnfolder]: 1596/2536 cut-off events. [2022-12-13 16:09:57,056 INFO L131 PetriNetUnfolder]: For 10876/11166 co-relation queries the response was YES. [2022-12-13 16:09:57,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10079 conditions, 2536 events. 1596/2536 cut-off events. For 10876/11166 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 13817 event pairs, 315 based on Foata normal form. 101/2499 useless extension candidates. Maximal degree in co-relation 10065. Up to 1606 conditions per place. [2022-12-13 16:09:57,069 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 45 selfloop transitions, 15 changer transitions 1/67 dead transitions. [2022-12-13 16:09:57,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 528 flow [2022-12-13 16:09:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:09:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:09:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2022-12-13 16:09:57,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4819277108433735 [2022-12-13 16:09:57,072 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2022-12-13 16:09:57,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2022-12-13 16:09:57,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:57,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2022-12-13 16:09:57,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,075 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 298 flow. Second operand 5 states and 600 transitions. [2022-12-13 16:09:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 528 flow [2022-12-13 16:09:57,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:09:57,081 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 385 flow [2022-12-13 16:09:57,081 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2022-12-13 16:09:57,082 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-12-13 16:09:57,082 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 385 flow [2022-12-13 16:09:57,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:57,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:09:57,083 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1534513424, now seen corresponding path program 2 times [2022-12-13 16:09:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:57,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334767825] [2022-12-13 16:09:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:57,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:57,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334767825] [2022-12-13 16:09:57,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334767825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:57,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:57,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:09:57,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803142876] [2022-12-13 16:09:57,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:57,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:09:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:09:57,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:09:57,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-12-13 16:09:57,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:57,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-12-13 16:09:57,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:57,510 INFO L130 PetriNetUnfolder]: 1105/1860 cut-off events. [2022-12-13 16:09:57,510 INFO L131 PetriNetUnfolder]: For 11689/12038 co-relation queries the response was YES. [2022-12-13 16:09:57,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8442 conditions, 1860 events. 1105/1860 cut-off events. For 11689/12038 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 10620 event pairs, 178 based on Foata normal form. 354/2139 useless extension candidates. Maximal degree in co-relation 8426. Up to 1000 conditions per place. [2022-12-13 16:09:57,515 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 76 selfloop transitions, 8 changer transitions 18/111 dead transitions. [2022-12-13 16:09:57,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 1116 flow [2022-12-13 16:09:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:09:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:09:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-12-13 16:09:57,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4674698795180723 [2022-12-13 16:09:57,517 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2022-12-13 16:09:57,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2022-12-13 16:09:57,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:57,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2022-12-13 16:09:57,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,520 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 385 flow. Second operand 5 states and 582 transitions. [2022-12-13 16:09:57,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 1116 flow [2022-12-13 16:09:57,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 1063 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 16:09:57,527 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 407 flow [2022-12-13 16:09:57,527 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2022-12-13 16:09:57,527 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2022-12-13 16:09:57,527 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 407 flow [2022-12-13 16:09:57,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:57,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:57,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:09:57,528 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash -314100756, now seen corresponding path program 1 times [2022-12-13 16:09:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:57,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032626166] [2022-12-13 16:09:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:57,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:57,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032626166] [2022-12-13 16:09:57,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032626166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:57,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:57,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:09:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501517744] [2022-12-13 16:09:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:57,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:57,673 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-12-13 16:09:57,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 407 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 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-12-13 16:09:57,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:57,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-12-13 16:09:57,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:57,953 INFO L130 PetriNetUnfolder]: 831/1451 cut-off events. [2022-12-13 16:09:57,953 INFO L131 PetriNetUnfolder]: For 8268/8604 co-relation queries the response was YES. [2022-12-13 16:09:57,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 1451 events. 831/1451 cut-off events. For 8268/8604 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8352 event pairs, 79 based on Foata normal form. 251/1650 useless extension candidates. Maximal degree in co-relation 6944. Up to 543 conditions per place. [2022-12-13 16:09:57,958 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 80 selfloop transitions, 14 changer transitions 29/132 dead transitions. [2022-12-13 16:09:57,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 132 transitions, 1297 flow [2022-12-13 16:09:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:09:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:09:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 815 transitions. [2022-12-13 16:09:57,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46758462421113023 [2022-12-13 16:09:57,960 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 815 transitions. [2022-12-13 16:09:57,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 815 transitions. [2022-12-13 16:09:57,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:57,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 815 transitions. [2022-12-13 16:09:57,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,962 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:57,963 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 407 flow. Second operand 7 states and 815 transitions. [2022-12-13 16:09:57,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 132 transitions, 1297 flow [2022-12-13 16:09:57,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 1215 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 16:09:57,969 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 434 flow [2022-12-13 16:09:57,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2022-12-13 16:09:57,970 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2022-12-13 16:09:57,970 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 434 flow [2022-12-13 16:09:57,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 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-12-13 16:09:57,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:57,970 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:57,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:09:57,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash -34607177, now seen corresponding path program 1 times [2022-12-13 16:09:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:57,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555163957] [2022-12-13 16:09:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:58,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555163957] [2022-12-13 16:09:58,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555163957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:58,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:58,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:09:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568699277] [2022-12-13 16:09:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:58,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:09:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:58,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:09:58,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:09:58,117 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-12-13 16:09:58,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:58,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:58,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-12-13 16:09:58,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:58,413 INFO L130 PetriNetUnfolder]: 774/1357 cut-off events. [2022-12-13 16:09:58,413 INFO L131 PetriNetUnfolder]: For 6660/6986 co-relation queries the response was YES. [2022-12-13 16:09:58,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6850 conditions, 1357 events. 774/1357 cut-off events. For 6660/6986 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7854 event pairs, 69 based on Foata normal form. 164/1472 useless extension candidates. Maximal degree in co-relation 6828. Up to 519 conditions per place. [2022-12-13 16:09:58,417 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 62 selfloop transitions, 17 changer transitions 47/132 dead transitions. [2022-12-13 16:09:58,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 1282 flow [2022-12-13 16:09:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:09:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:09:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1027 transitions. [2022-12-13 16:09:58,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45827755466309683 [2022-12-13 16:09:58,419 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1027 transitions. [2022-12-13 16:09:58,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1027 transitions. [2022-12-13 16:09:58,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:58,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1027 transitions. [2022-12-13 16:09:58,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:58,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:58,423 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:58,423 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 434 flow. Second operand 9 states and 1027 transitions. [2022-12-13 16:09:58,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 1282 flow [2022-12-13 16:09:58,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 1199 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-12-13 16:09:58,439 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 379 flow [2022-12-13 16:09:58,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=379, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2022-12-13 16:09:58,439 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-12-13 16:09:58,440 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 379 flow [2022-12-13 16:09:58,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:58,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:58,440 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:09:58,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:09:58,440 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash 751517207, now seen corresponding path program 1 times [2022-12-13 16:09:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:58,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351899902] [2022-12-13 16:09:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:09:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:09:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:09:58,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351899902] [2022-12-13 16:09:58,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351899902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:09:58,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:09:58,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:09:58,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509925032] [2022-12-13 16:09:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:09:58,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:09:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:09:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:09:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:09:58,769 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 249 [2022-12-13 16:09:58,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 48 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:58,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:09:58,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 249 [2022-12-13 16:09:58,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:09:59,091 INFO L130 PetriNetUnfolder]: 868/1561 cut-off events. [2022-12-13 16:09:59,091 INFO L131 PetriNetUnfolder]: For 5849/5888 co-relation queries the response was YES. [2022-12-13 16:09:59,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7501 conditions, 1561 events. 868/1561 cut-off events. For 5849/5888 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8744 event pairs, 183 based on Foata normal form. 36/1588 useless extension candidates. Maximal degree in co-relation 7477. Up to 932 conditions per place. [2022-12-13 16:09:59,095 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 39 selfloop transitions, 3 changer transitions 76/120 dead transitions. [2022-12-13 16:09:59,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 1164 flow [2022-12-13 16:09:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:09:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:09:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 673 transitions. [2022-12-13 16:09:59,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4504685408299866 [2022-12-13 16:09:59,097 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 673 transitions. [2022-12-13 16:09:59,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 673 transitions. [2022-12-13 16:09:59,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:09:59,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 673 transitions. [2022-12-13 16:09:59,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:59,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:59,099 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:59,099 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 379 flow. Second operand 6 states and 673 transitions. [2022-12-13 16:09:59,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 1164 flow [2022-12-13 16:09:59,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 120 transitions, 983 flow, removed 37 selfloop flow, removed 13 redundant places. [2022-12-13 16:09:59,117 INFO L231 Difference]: Finished difference. Result has 69 places, 34 transitions, 216 flow [2022-12-13 16:09:59,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=34} [2022-12-13 16:09:59,118 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2022-12-13 16:09:59,118 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 34 transitions, 216 flow [2022-12-13 16:09:59,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:09:59,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:09:59,118 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:09:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:09:59,119 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:09:59,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:09:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash 441867259, now seen corresponding path program 2 times [2022-12-13 16:09:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:09:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734113722] [2022-12-13 16:09:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:09:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:09:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:09:59,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:09:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:09:59,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:09:59,204 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:09:59,205 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 16:09:59,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 16:09:59,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 16:09:59,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 16:09:59,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 16:09:59,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 16:09:59,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 16:09:59,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:09:59,208 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:09:59,212 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:09:59,213 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:09:59,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:09:59 BasicIcfg [2022-12-13 16:09:59,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:09:59,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:09:59,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:09:59,271 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:09:59,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:09:46" (3/4) ... [2022-12-13 16:09:59,274 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:09:59,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:09:59,274 INFO L158 Benchmark]: Toolchain (without parser) took 14200.38ms. Allocated memory was 111.1MB in the beginning and 302.0MB in the end (delta: 190.8MB). Free memory was 60.6MB in the beginning and 263.4MB in the end (delta: -202.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:09:59,274 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:09:59,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.78ms. Allocated memory was 111.1MB in the beginning and 209.7MB in the end (delta: 98.6MB). Free memory was 60.3MB in the beginning and 167.1MB in the end (delta: -106.7MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-12-13 16:09:59,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.07ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 163.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:09:59,275 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 209.7MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:09:59,275 INFO L158 Benchmark]: RCFGBuilder took 549.25ms. Allocated memory is still 209.7MB. Free memory was 161.8MB in the beginning and 126.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 16:09:59,276 INFO L158 Benchmark]: TraceAbstraction took 13231.47ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 125.1MB in the beginning and 263.4MB in the end (delta: -138.3MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2022-12-13 16:09:59,276 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 302.0MB. Free memory is still 263.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:09:59,277 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.11ms. Allocated memory is still 111.1MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.78ms. Allocated memory was 111.1MB in the beginning and 209.7MB in the end (delta: 98.6MB). Free memory was 60.3MB in the beginning and 167.1MB in the end (delta: -106.7MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.07ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 163.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 209.7MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 549.25ms. Allocated memory is still 209.7MB. Free memory was 161.8MB in the beginning and 126.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13231.47ms. Allocated memory was 209.7MB in the beginning and 302.0MB in the end (delta: 92.3MB). Free memory was 125.1MB in the beginning and 263.4MB in the end (delta: -138.3MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 302.0MB. Free memory is still 263.4MB. 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: 4.7s, 132 PlacesBefore, 41 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2404 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 6177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2607, independent: 2436, independent conditional: 0, independent unconditional: 2436, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1288, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2607, independent: 1195, independent conditional: 0, independent unconditional: 1195, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 1288, unknown conditional: 0, unknown unconditional: 1288] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-2, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: 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, 155 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 723 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1508 IncrementalHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 55 mSDtfsCounter, 1508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=13, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 1823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:09:59,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- 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-2329fc7 [2022-12-13 16:10:00,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:10:00,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:10:00,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:10:00,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:10:00,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:10:00,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:10:00,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:10:00,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:10:00,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:10:00,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:10:00,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:10:00,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:10:00,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:10:00,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:10:00,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:10:00,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:10:00,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:10:01,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:10:01,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:10:01,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:10:01,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:10:01,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:10:01,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:10:01,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:10:01,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:10:01,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:10:01,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:10:01,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:10:01,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:10:01,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:10:01,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:10:01,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:10:01,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:10:01,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:10:01,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:10:01,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:10:01,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:10:01,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:10:01,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:10:01,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:10:01,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 16:10:01,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:10:01,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:10:01,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:10:01,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:10:01,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:10:01,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:10:01,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:10:01,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:10:01,047 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:10:01,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:10:01,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:10:01,048 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:10:01,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:10:01,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:10:01,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:10:01,049 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:10:01,049 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:10:01,049 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:10:01,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:10:01,049 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:10:01,050 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:10:01,050 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:10:01,050 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:10:01,050 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:10:01,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:10:01,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:10:01,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:10:01,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:10:01,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:10:01,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:10:01,052 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:10:01,060 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:10:01,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:10:01,060 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:10:01,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:10:01,061 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:10:01,061 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:10:01,061 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8 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 -> Automizer 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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2022-12-13 16:10:01,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:10:01,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:10:01,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:10:01,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:10:01,308 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:10:01,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-12-13 16:10:03,931 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:10:04,092 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:10:04,093 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-12-13 16:10:04,103 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data/96eb0c905/e7435cd4f224453f8c34d7a29893c260/FLAG8f59b61f2 [2022-12-13 16:10:04,113 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/data/96eb0c905/e7435cd4f224453f8c34d7a29893c260 [2022-12-13 16:10:04,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:10:04,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:10:04,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:10:04,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:10:04,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:10:04,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4afa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04, skipping insertion in model container [2022-12-13 16:10:04,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:10:04,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:10:04,259 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-13 16:10:04,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:10:04,418 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:10:04,427 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-13 16:10:04,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:04,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:04,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:10:04,481 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:10:04,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04 WrapperNode [2022-12-13 16:10:04,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:10:04,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:10:04,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:10:04,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:10:04,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,527 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 16:10:04,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:10:04,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:10:04,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:10:04,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:10:04,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,545 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:10:04,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:10:04,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:10:04,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:10:04,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (1/1) ... [2022-12-13 16:10:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:10:04,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:10:04,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:10:04,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:10:04,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:10:04,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:10:04,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:10:04,599 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:10:04,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:10:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:10:04,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:10:04,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:10:04,601 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:10:04,712 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:10:04,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:10:04,986 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:10:05,155 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:10:05,155 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:10:05,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:10:05 BoogieIcfgContainer [2022-12-13 16:10:05,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:10:05,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:10:05,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:10:05,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:10:05,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:10:04" (1/3) ... [2022-12-13 16:10:05,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@861e4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:10:05, skipping insertion in model container [2022-12-13 16:10:05,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:04" (2/3) ... [2022-12-13 16:10:05,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@861e4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:10:05, skipping insertion in model container [2022-12-13 16:10:05,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:10:05" (3/3) ... [2022-12-13 16:10:05,166 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-12-13 16:10:05,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:10:05,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 16:10:05,180 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:10:05,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:10:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 128 transitions, 271 flow [2022-12-13 16:10:05,320 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 16:10:05,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:05,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:10:05,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 128 transitions, 271 flow [2022-12-13 16:10:05,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 125 transitions, 259 flow [2022-12-13 16:10:05,330 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:10:05,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 259 flow [2022-12-13 16:10:05,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 259 flow [2022-12-13 16:10:05,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 259 flow [2022-12-13 16:10:05,359 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 16:10:05,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:05,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-13 16:10:05,361 INFO L119 LiptonReduction]: Number of co-enabled transitions 2404 [2022-12-13 16:10:14,384 INFO L134 LiptonReduction]: Checked pairs total: 7145 [2022-12-13 16:10:14,384 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-12-13 16:10:14,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:10:14,405 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=PETRI_NET, 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;@4b5668a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:10:14,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 16:10:14,406 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:10:14,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:14,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:14,407 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:10:14,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 542, now seen corresponding path program 1 times [2022-12-13 16:10:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:14,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285494635] [2022-12-13 16:10:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:14,422 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-12-13 16:10:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:14,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:14,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:14,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:10:14,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:14,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:14,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:14,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285494635] [2022-12-13 16:10:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285494635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:14,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:14,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:10:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396671448] [2022-12-13 16:10:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:14,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:10:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:14,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:10:14,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:10:14,506 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 245 [2022-12-13 16:10:14,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:14,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:14,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 245 [2022-12-13 16:10:14,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:14,912 INFO L130 PetriNetUnfolder]: 1093/1662 cut-off events. [2022-12-13 16:10:14,912 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 16:10:14,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 1662 events. 1093/1662 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8021 event pairs, 1093 based on Foata normal form. 0/1354 useless extension candidates. Maximal degree in co-relation 3328. Up to 1623 conditions per place. [2022-12-13 16:10:14,929 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-13 16:10:14,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2022-12-13 16:10:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:10:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:10:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions. [2022-12-13 16:10:14,943 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5244897959183673 [2022-12-13 16:10:14,944 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 257 transitions. [2022-12-13 16:10:14,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions. [2022-12-13 16:10:14,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:14,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions. [2022-12-13 16:10:14,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:14,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:14,957 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:14,959 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 2 states and 257 transitions. [2022-12-13 16:10:14,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2022-12-13 16:10:14,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:10:14,962 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-12-13 16:10:14,963 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 16:10:14,966 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-12-13 16:10:14,966 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-12-13 16:10:14,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:14,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:14,966 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 16:10:14,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:15,170 INFO L85 PathProgramCache]: Analyzing trace with hash 511822891, now seen corresponding path program 1 times [2022-12-13 16:10:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:15,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021690877] [2022-12-13 16:10:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:15,173 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-12-13 16:10:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:15,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:15,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:10:15,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:15,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:15,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:15,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021690877] [2022-12-13 16:10:15,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021690877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:15,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:15,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:10:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825508591] [2022-12-13 16:10:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:15,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:10:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:15,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:10:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:10:15,406 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 245 [2022-12-13 16:10:15,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:15,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:15,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 245 [2022-12-13 16:10:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:15,645 INFO L130 PetriNetUnfolder]: 855/1394 cut-off events. [2022-12-13 16:10:15,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:15,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1394 events. 855/1394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7420 event pairs, 141 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 2716. Up to 1027 conditions per place. [2022-12-13 16:10:15,650 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2022-12-13 16:10:15,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 148 flow [2022-12-13 16:10:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:10:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:10:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-12-13 16:10:15,653 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5115646258503401 [2022-12-13 16:10:15,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2022-12-13 16:10:15,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2022-12-13 16:10:15,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:15,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2022-12-13 16:10:15,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:15,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:15,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:15,658 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 376 transitions. [2022-12-13 16:10:15,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 148 flow [2022-12-13 16:10:15,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:10:15,659 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-12-13 16:10:15,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 16:10:15,660 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 16:10:15,660 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-12-13 16:10:15,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:15,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:15,660 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:15,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:10:15,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash 915748538, now seen corresponding path program 1 times [2022-12-13 16:10:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:15,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698532721] [2022-12-13 16:10:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:15,862 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-12-13 16:10:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:15,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:15,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:10:15,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:15,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:15,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:15,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698532721] [2022-12-13 16:10:15,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698532721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:15,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:15,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:10:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324221596] [2022-12-13 16:10:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:15,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:10:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:10:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:10:15,991 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2022-12-13 16:10:15,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:15,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:15,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2022-12-13 16:10:15,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:16,231 INFO L130 PetriNetUnfolder]: 494/837 cut-off events. [2022-12-13 16:10:16,231 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 16:10:16,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 837 events. 494/837 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3973 event pairs, 102 based on Foata normal form. 64/854 useless extension candidates. Maximal degree in co-relation 1759. Up to 533 conditions per place. [2022-12-13 16:10:16,234 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 28 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2022-12-13 16:10:16,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 232 flow [2022-12-13 16:10:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-12-13 16:10:16,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 16:10:16,238 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2022-12-13 16:10:16,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2022-12-13 16:10:16,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:16,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2022-12-13 16:10:16,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,246 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 588 transitions. [2022-12-13 16:10:16,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 232 flow [2022-12-13 16:10:16,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:16,248 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2022-12-13 16:10:16,249 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 16:10:16,249 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 16:10:16,250 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2022-12-13 16:10:16,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:16,250 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:16,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:10:16,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:16,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1911584333, now seen corresponding path program 1 times [2022-12-13 16:10:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:16,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704537918] [2022-12-13 16:10:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:16,452 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-12-13 16:10:16,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:16,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:16,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:16,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:10:16,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:16,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:16,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704537918] [2022-12-13 16:10:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704537918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:16,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:16,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:10:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238761648] [2022-12-13 16:10:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:16,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:10:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:10:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:10:16,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2022-12-13 16:10:16,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:16,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2022-12-13 16:10:16,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:16,829 INFO L130 PetriNetUnfolder]: 224/432 cut-off events. [2022-12-13 16:10:16,830 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-13 16:10:16,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 432 events. 224/432 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1887 event pairs, 60 based on Foata normal form. 37/454 useless extension candidates. Maximal degree in co-relation 1136. Up to 137 conditions per place. [2022-12-13 16:10:16,833 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 36 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2022-12-13 16:10:16,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 336 flow [2022-12-13 16:10:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:10:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:10:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2022-12-13 16:10:16,836 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48027210884353744 [2022-12-13 16:10:16,836 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2022-12-13 16:10:16,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2022-12-13 16:10:16,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:16,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2022-12-13 16:10:16,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,842 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,842 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 706 transitions. [2022-12-13 16:10:16,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 336 flow [2022-12-13 16:10:16,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:16,846 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2022-12-13 16:10:16,846 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 16:10:16,847 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-12-13 16:10:16,847 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2022-12-13 16:10:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:16,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:16,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:16,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1877048514, now seen corresponding path program 1 times [2022-12-13 16:10:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:17,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740443529] [2022-12-13 16:10:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:17,049 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-12-13 16:10:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:17,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:17,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:10:17,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:17,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:17,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:17,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740443529] [2022-12-13 16:10:17,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1740443529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:17,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:17,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:10:17,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475606839] [2022-12-13 16:10:17,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:17,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:10:17,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:10:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:10:17,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2022-12-13 16:10:17,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:17,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:17,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2022-12-13 16:10:17,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:17,427 INFO L130 PetriNetUnfolder]: 143/288 cut-off events. [2022-12-13 16:10:17,427 INFO L131 PetriNetUnfolder]: For 260/260 co-relation queries the response was YES. [2022-12-13 16:10:17,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 288 events. 143/288 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1144 event pairs, 56 based on Foata normal form. 10/292 useless extension candidates. Maximal degree in co-relation 811. Up to 108 conditions per place. [2022-12-13 16:10:17,429 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 33 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2022-12-13 16:10:17,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 334 flow [2022-12-13 16:10:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:10:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:10:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2022-12-13 16:10:17,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46880466472303206 [2022-12-13 16:10:17,431 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2022-12-13 16:10:17,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2022-12-13 16:10:17,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:17,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2022-12-13 16:10:17,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:17,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:17,437 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:17,437 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 804 transitions. [2022-12-13 16:10:17,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 334 flow [2022-12-13 16:10:17,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 16:10:17,441 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2022-12-13 16:10:17,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-13 16:10:17,442 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-12-13 16:10:17,442 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2022-12-13 16:10:17,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:17,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:17,443 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:10:17,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:10:17,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2047214685, now seen corresponding path program 1 times [2022-12-13 16:10:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:17,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527858443] [2022-12-13 16:10:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:17,648 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-12-13 16:10:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:17,651 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:17,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:10:17,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:17,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:17,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527858443] [2022-12-13 16:10:17,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527858443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:17,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:17,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:10:17,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597650127] [2022-12-13 16:10:17,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:17,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:10:17,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:10:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:10:17,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2022-12-13 16:10:17,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:17,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:17,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2022-12-13 16:10:17,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:17,992 INFO L130 PetriNetUnfolder]: 198/396 cut-off events. [2022-12-13 16:10:17,992 INFO L131 PetriNetUnfolder]: For 420/420 co-relation queries the response was YES. [2022-12-13 16:10:17,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 396 events. 198/396 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1792 event pairs, 18 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 1109. Up to 223 conditions per place. [2022-12-13 16:10:17,995 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 53 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2022-12-13 16:10:17,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 406 flow [2022-12-13 16:10:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:10:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:10:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-12-13 16:10:17,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4959183673469388 [2022-12-13 16:10:17,997 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2022-12-13 16:10:17,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2022-12-13 16:10:17,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:17,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2022-12-13 16:10:17,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,000 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,001 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 486 transitions. [2022-12-13 16:10:18,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 406 flow [2022-12-13 16:10:18,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 326 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 16:10:18,004 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow [2022-12-13 16:10:18,004 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-13 16:10:18,005 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-12-13 16:10:18,005 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow [2022-12-13 16:10:18,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,005 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:18,006 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:10:18,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 16:10:18,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:18,206 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1954009873, now seen corresponding path program 2 times [2022-12-13 16:10:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:18,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112912216] [2022-12-13 16:10:18,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:10:18,208 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-12-13 16:10:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:18,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:18,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:18,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:10:18,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:10:18,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 16:10:18,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:18,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:18,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:18,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112912216] [2022-12-13 16:10:18,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112912216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:18,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:18,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:10:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885553174] [2022-12-13 16:10:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:18,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:10:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:10:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:10:18,613 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2022-12-13 16:10:18,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:18,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2022-12-13 16:10:18,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:18,822 INFO L130 PetriNetUnfolder]: 300/614 cut-off events. [2022-12-13 16:10:18,822 INFO L131 PetriNetUnfolder]: For 436/436 co-relation queries the response was YES. [2022-12-13 16:10:18,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 614 events. 300/614 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3054 event pairs, 78 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 1646. Up to 266 conditions per place. [2022-12-13 16:10:18,824 INFO L137 encePairwiseOnDemand]: 239/245 looper letters, 51 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2022-12-13 16:10:18,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 352 flow [2022-12-13 16:10:18,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-12-13 16:10:18,829 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48489795918367345 [2022-12-13 16:10:18,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2022-12-13 16:10:18,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2022-12-13 16:10:18,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:18,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2022-12-13 16:10:18,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,832 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,832 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 5 states and 594 transitions. [2022-12-13 16:10:18,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 352 flow [2022-12-13 16:10:18,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:10:18,834 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 146 flow [2022-12-13 16:10:18,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-12-13 16:10:18,834 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 16:10:18,834 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 146 flow [2022-12-13 16:10:18,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:18,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:18,835 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:10:18,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:19,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash -867795600, now seen corresponding path program 1 times [2022-12-13 16:10:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:19,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284142741] [2022-12-13 16:10:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:19,036 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-12-13 16:10:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:19,037 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:19,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:19,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 16:10:19,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:19,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:19,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:19,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284142741] [2022-12-13 16:10:19,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284142741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:19,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:19,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:10:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143744680] [2022-12-13 16:10:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:19,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:10:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:19,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:10:19,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:10:19,591 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 245 [2022-12-13 16:10:19,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:19,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:19,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 245 [2022-12-13 16:10:19,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:19,816 INFO L130 PetriNetUnfolder]: 267/557 cut-off events. [2022-12-13 16:10:19,817 INFO L131 PetriNetUnfolder]: For 622/622 co-relation queries the response was YES. [2022-12-13 16:10:19,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1766 conditions, 557 events. 267/557 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2821 event pairs, 43 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 1755. Up to 441 conditions per place. [2022-12-13 16:10:19,818 INFO L137 encePairwiseOnDemand]: 241/245 looper letters, 26 selfloop transitions, 3 changer transitions 10/44 dead transitions. [2022-12-13 16:10:19,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 277 flow [2022-12-13 16:10:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2022-12-13 16:10:19,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4269387755102041 [2022-12-13 16:10:19,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2022-12-13 16:10:19,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2022-12-13 16:10:19,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:19,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2022-12-13 16:10:19,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:19,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:19,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:19,826 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 146 flow. Second operand 5 states and 523 transitions. [2022-12-13 16:10:19,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 277 flow [2022-12-13 16:10:19,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 44 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:19,829 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 140 flow [2022-12-13 16:10:19,829 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2022-12-13 16:10:19,829 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 16:10:19,830 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 140 flow [2022-12-13 16:10:19,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:19,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:19,830 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:10:19,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 16:10:20,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:20,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1802794691, now seen corresponding path program 3 times [2022-12-13 16:10:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:20,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009179996] [2022-12-13 16:10:20,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:10:20,035 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-12-13 16:10:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:20,038 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:20,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:20,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 16:10:20,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:10:20,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 16:10:20,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:20,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:20,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:20,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009179996] [2022-12-13 16:10:20,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009179996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:20,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:20,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:10:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413952159] [2022-12-13 16:10:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:20,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:10:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:10:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:10:20,494 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2022-12-13 16:10:20,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 140 flow. Second operand has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:20,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:20,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2022-12-13 16:10:20,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:20,647 INFO L130 PetriNetUnfolder]: 239/486 cut-off events. [2022-12-13 16:10:20,647 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2022-12-13 16:10:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 486 events. 239/486 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2193 event pairs, 61 based on Foata normal form. 1/485 useless extension candidates. Maximal degree in co-relation 1525. Up to 188 conditions per place. [2022-12-13 16:10:20,648 INFO L137 encePairwiseOnDemand]: 240/245 looper letters, 38 selfloop transitions, 6 changer transitions 12/59 dead transitions. [2022-12-13 16:10:20,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 378 flow [2022-12-13 16:10:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-12-13 16:10:20,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.483265306122449 [2022-12-13 16:10:20,650 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2022-12-13 16:10:20,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2022-12-13 16:10:20,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:20,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2022-12-13 16:10:20,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:20,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:20,652 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:20,652 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 140 flow. Second operand 5 states and 592 transitions. [2022-12-13 16:10:20,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 378 flow [2022-12-13 16:10:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 367 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 16:10:20,654 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 154 flow [2022-12-13 16:10:20,654 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2022-12-13 16:10:20,654 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 16:10:20,654 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 154 flow [2022-12-13 16:10:20,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.11111111111111) internal successors, (1009), 9 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:20,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:20,655 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:10:20,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 16:10:20,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:20,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:20,856 INFO L85 PathProgramCache]: Analyzing trace with hash 299520203, now seen corresponding path program 4 times [2022-12-13 16:10:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:20,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361324759] [2022-12-13 16:10:20,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 16:10:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:10:20,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:20,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:20,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:20,971 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 16:10:20,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:10:20,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:10:20,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:10:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:20,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:10:20,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:10:20,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361324759] [2022-12-13 16:10:20,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361324759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:20,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:20,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:10:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247064522] [2022-12-13 16:10:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:20,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:10:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:10:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:10:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:10:21,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2022-12-13 16:10:21,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:21,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:21,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2022-12-13 16:10:21,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:21,172 INFO L130 PetriNetUnfolder]: 333/694 cut-off events. [2022-12-13 16:10:21,172 INFO L131 PetriNetUnfolder]: For 777/782 co-relation queries the response was YES. [2022-12-13 16:10:21,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 694 events. 333/694 cut-off events. For 777/782 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3520 event pairs, 161 based on Foata normal form. 6/695 useless extension candidates. Maximal degree in co-relation 2273. Up to 266 conditions per place. [2022-12-13 16:10:21,175 INFO L137 encePairwiseOnDemand]: 242/245 looper letters, 24 selfloop transitions, 1 changer transitions 30/58 dead transitions. [2022-12-13 16:10:21,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 393 flow [2022-12-13 16:10:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:10:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:10:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2022-12-13 16:10:21,176 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2022-12-13 16:10:21,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2022-12-13 16:10:21,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2022-12-13 16:10:21,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:21,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2022-12-13 16:10:21,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:21,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:21,180 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:21,180 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 154 flow. Second operand 4 states and 480 transitions. [2022-12-13 16:10:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 393 flow [2022-12-13 16:10:21,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:21,182 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 129 flow [2022-12-13 16:10:21,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2022-12-13 16:10:21,183 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2022-12-13 16:10:21,183 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 129 flow [2022-12-13 16:10:21,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:21,183 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:21,183 INFO L209 CegarLoopForPetriNet]: 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-12-13 16:10:21,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 16:10:21,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:21,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash -509871361, now seen corresponding path program 5 times [2022-12-13 16:10:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:10:21,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991049952] [2022-12-13 16:10:21,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 16:10:21,388 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-12-13 16:10:21,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:10:21,391 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:21,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:21,598 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:10:21,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 16:10:21,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:10:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:10:21,693 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 16:10:21,694 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:10:21,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 16:10:21,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 16:10:21,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 16:10:21,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 16:10:21,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 16:10:21,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 16:10:21,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 16:10:21,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/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-12-13 16:10:21,899 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:21,915 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:10:21,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:10:21,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:10:21 BasicIcfg [2022-12-13 16:10:21,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:10:21,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:10:21,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:10:21,992 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:10:21,993 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:10:05" (3/4) ... [2022-12-13 16:10:21,995 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:10:21,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:10:21,996 INFO L158 Benchmark]: Toolchain (without parser) took 17879.46ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 50.4MB in the beginning and 63.3MB in the end (delta: -12.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-12-13 16:10:21,996 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 52.4MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:10:21,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.77ms. Allocated memory is still 75.5MB. Free memory was 50.2MB in the beginning and 41.6MB in the end (delta: 8.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-12-13 16:10:21,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.01ms. Allocated memory is still 75.5MB. Free memory was 41.6MB in the beginning and 39.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:10:21,997 INFO L158 Benchmark]: Boogie Preprocessor took 20.91ms. Allocated memory is still 75.5MB. Free memory was 39.0MB in the beginning and 36.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:10:21,997 INFO L158 Benchmark]: RCFGBuilder took 609.23ms. Allocated memory is still 75.5MB. Free memory was 36.8MB in the beginning and 40.8MB in the end (delta: -4.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-12-13 16:10:21,998 INFO L158 Benchmark]: TraceAbstraction took 16831.00ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 40.2MB in the beginning and 64.3MB in the end (delta: -24.1MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-12-13 16:10:21,998 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 111.1MB. Free memory was 64.3MB in the beginning and 63.3MB in the end (delta: 989.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:10:22,000 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.11ms. Allocated memory is still 52.4MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.77ms. Allocated memory is still 75.5MB. Free memory was 50.2MB in the beginning and 41.6MB in the end (delta: 8.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.01ms. Allocated memory is still 75.5MB. Free memory was 41.6MB in the beginning and 39.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.91ms. Allocated memory is still 75.5MB. Free memory was 39.0MB in the beginning and 36.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.23ms. Allocated memory is still 75.5MB. Free memory was 36.8MB in the beginning and 40.8MB in the end (delta: -4.0MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16831.00ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 40.2MB in the beginning and 64.3MB in the end (delta: -24.1MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 111.1MB. Free memory was 64.3MB in the beginning and 63.3MB in the end (delta: 989.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 133 PlacesBefore, 41 PlacesAfterwards, 125 TransitionsBefore, 31 TransitionsAfterwards, 2404 CoEnabledTransitionPairs, 8 FixpointIterations, 46 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 7145 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2906, independent: 2679, independent conditional: 0, independent unconditional: 2679, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1265, independent: 1225, independent conditional: 0, independent unconditional: 1225, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2906, independent: 1454, independent conditional: 0, independent unconditional: 1454, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1265, unknown conditional: 0, unknown unconditional: 1265] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-1, t515={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=0, t515={3:0}, t516={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=1, t515={3:0}, t516={7:0}, t517={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={3:0}, t516={7:0}, t517={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: 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: 830]: 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, 156 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 425 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1185 IncrementalHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 17 mSDtfsCounter, 1185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 17 QuantifiedInterpolants, 1619 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-12-13 16:10:22,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01375f8e-b6fb-4c16-a97c-bea0bf517e9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample