./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- 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 21:52:21,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:52:21,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:52:21,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:52:21,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:52:21,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:52:21,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:52:21,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:52:21,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:52:21,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:52:21,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:52:21,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:52:21,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:52:21,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:52:21,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:52:21,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:52:21,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:52:21,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:52:21,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:52:21,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:52:21,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:52:21,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:52:21,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:52:21,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:52:21,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:52:21,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:52:21,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:52:21,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:52:21,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:52:21,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:52:21,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:52:21,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:52:21,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:52:21,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:52:21,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:52:21,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:52:21,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:52:21,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:52:21,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:52:21,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:52:21,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:52:21,517 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 21:52:21,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:52:21,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:52:21,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:52:21,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:52:21,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:52:21,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:52:21,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:52:21,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:52:21,532 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:52:21,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:52:21,532 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:52:21,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:52:21,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:52:21,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:52:21,534 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:52:21,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:52:21,535 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:52:21,535 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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2022-12-13 21:52:21,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:52:21,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:52:21,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:52:21,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:52:21,765 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:52:21,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-12-13 21:52:24,386 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:52:24,598 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:52:24,599 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-12-13 21:52:24,610 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data/3546a8d68/330decbe021b444680ef5e810558c8cd/FLAGa4b8b99cc [2022-12-13 21:52:24,624 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data/3546a8d68/330decbe021b444680ef5e810558c8cd [2022-12-13 21:52:24,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:52:24,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:52:24,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:52:24,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:52:24,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:52:24,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:24,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a64301a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24, skipping insertion in model container [2022-12-13 21:52:24,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:24,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:52:24,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:52:24,781 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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-12-13 21:52:24,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:52:24,927 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:52:24,936 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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-12-13 21:52:24,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:52:24,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:52:24,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:52:24,998 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:52:24,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24 WrapperNode [2022-12-13 21:52:24,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:52:24,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:52:24,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:52:24,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:52:25,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,032 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 21:52:25,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:52:25,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:52:25,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:52:25,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:52:25,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,052 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:52:25,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:52:25,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:52:25,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:52:25,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (1/1) ... [2022-12-13 21:52:25,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:52:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:52:25,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:52:25,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:52:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:52:25,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:52:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:52:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:52:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:52:25,124 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:52:25,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:52:25,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:52:25,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:52:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:52:25,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:52:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 21:52:25,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 21:52:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:52:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:52:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:52:25,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:52:25,133 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 21:52:25,251 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:52:25,253 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:52:25,567 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:52:25,642 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:52:25,643 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:52:25,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:52:25 BoogieIcfgContainer [2022-12-13 21:52:25,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:52:25,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:52:25,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:52:25,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:52:25,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:52:24" (1/3) ... [2022-12-13 21:52:25,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69880132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:52:25, skipping insertion in model container [2022-12-13 21:52:25,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:52:24" (2/3) ... [2022-12-13 21:52:25,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69880132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:52:25, skipping insertion in model container [2022-12-13 21:52:25,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:52:25" (3/3) ... [2022-12-13 21:52:25,650 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2022-12-13 21:52:25,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:52:25,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 21:52:25,664 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:52:25,713 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:52:25,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 21:52:25,800 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 21:52:25,800 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:52:25,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 21:52:25,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 21:52:25,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-12-13 21:52:25,811 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:52:25,818 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 21:52:25,820 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 21:52:25,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-12-13 21:52:25,842 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 21:52:25,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:52:25,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 21:52:25,844 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-12-13 21:52:30,323 INFO L134 LiptonReduction]: Checked pairs total: 11243 [2022-12-13 21:52:30,323 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-12-13 21:52:30,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:52:30,342 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;@65fa8ef7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:52:30,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 21:52:30,344 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 21:52:30,344 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:52:30,344 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:30,344 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 21:52:30,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash 631, now seen corresponding path program 1 times [2022-12-13 21:52:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:30,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953392762] [2022-12-13 21:52:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:30,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:30,432 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 21:52:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953392762] [2022-12-13 21:52:30,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953392762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:30,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:30,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 21:52:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868840534] [2022-12-13 21:52:30,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:30,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:52:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:30,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:52:30,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:52:30,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 291 [2022-12-13 21:52:30,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 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 21:52:30,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:30,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 291 [2022-12-13 21:52:30,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:31,581 INFO L130 PetriNetUnfolder]: 7479/10189 cut-off events. [2022-12-13 21:52:31,581 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 21:52:31,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 10189 events. 7479/10189 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 52511 event pairs, 7479 based on Foata normal form. 0/8785 useless extension candidates. Maximal degree in co-relation 20485. Up to 10091 conditions per place. [2022-12-13 21:52:31,633 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-12-13 21:52:31,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2022-12-13 21:52:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:52:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:52:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-12-13 21:52:31,647 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5309278350515464 [2022-12-13 21:52:31,648 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-12-13 21:52:31,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-12-13 21:52:31,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:31,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-12-13 21:52:31,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 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 21:52:31,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 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 21:52:31,660 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 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 21:52:31,662 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2022-12-13 21:52:31,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2022-12-13 21:52:31,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:52:31,669 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2022-12-13 21:52:31,670 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 21:52:31,674 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2022-12-13 21:52:31,674 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2022-12-13 21:52:31,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 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 21:52:31,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:31,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:52:31,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:52:31,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 619203, now seen corresponding path program 1 times [2022-12-13 21:52:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:31,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105584322] [2022-12-13 21:52:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:31,859 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 21:52:31,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:31,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105584322] [2022-12-13 21:52:31,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105584322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:31,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:31,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:52:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077449185] [2022-12-13 21:52:31,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:31,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:31,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:31,865 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 291 [2022-12-13 21:52:31,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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 21:52:31,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:31,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 291 [2022-12-13 21:52:31,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:32,697 INFO L130 PetriNetUnfolder]: 5879/8510 cut-off events. [2022-12-13 21:52:32,697 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:52:32,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16651 conditions, 8510 events. 5879/8510 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51420 event pairs, 1079 based on Foata normal form. 0/7854 useless extension candidates. Maximal degree in co-relation 16648. Up to 6367 conditions per place. [2022-12-13 21:52:32,729 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2022-12-13 21:52:32,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2022-12-13 21:52:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2022-12-13 21:52:32,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5223367697594502 [2022-12-13 21:52:32,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2022-12-13 21:52:32,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2022-12-13 21:52:32,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:32,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2022-12-13 21:52:32,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 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 21:52:32,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:32,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:32,736 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 456 transitions. [2022-12-13 21:52:32,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2022-12-13 21:52:32,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:52:32,737 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-13 21:52:32,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 21:52:32,737 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-12-13 21:52:32,737 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-12-13 21:52:32,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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 21:52:32,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:32,738 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:32,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:52:32,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1206932749, now seen corresponding path program 1 times [2022-12-13 21:52:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:32,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045388303] [2022-12-13 21:52:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:52:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045388303] [2022-12-13 21:52:32,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045388303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:32,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:32,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:52:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929314781] [2022-12-13 21:52:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:32,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:32,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:32,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2022-12-13 21:52:32,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 21:52:32,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:32,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2022-12-13 21:52:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:35,056 INFO L130 PetriNetUnfolder]: 18905/25584 cut-off events. [2022-12-13 21:52:35,057 INFO L131 PetriNetUnfolder]: For 1301/1301 co-relation queries the response was YES. [2022-12-13 21:52:35,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52943 conditions, 25584 events. 18905/25584 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 136186 event pairs, 6836 based on Foata normal form. 0/24854 useless extension candidates. Maximal degree in co-relation 52939. Up to 16530 conditions per place. [2022-12-13 21:52:35,147 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2022-12-13 21:52:35,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2022-12-13 21:52:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-12-13 21:52:35,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5005727376861397 [2022-12-13 21:52:35,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2022-12-13 21:52:35,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2022-12-13 21:52:35,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:35,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2022-12-13 21:52:35,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 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 21:52:35,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:35,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:35,153 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 437 transitions. [2022-12-13 21:52:35,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2022-12-13 21:52:35,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:52:35,154 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2022-12-13 21:52:35,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-13 21:52:35,155 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2022-12-13 21:52:35,155 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2022-12-13 21:52:35,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 21:52:35,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:35,156 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:35,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:52:35,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1206932744, now seen corresponding path program 1 times [2022-12-13 21:52:35,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:35,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320177822] [2022-12-13 21:52:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:35,577 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 21:52:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:35,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320177822] [2022-12-13 21:52:35,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320177822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:35,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:35,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:52:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159580874] [2022-12-13 21:52:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:35,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:52:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:52:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:52:35,775 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2022-12-13 21:52:35,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 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 21:52:35,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:35,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2022-12-13 21:52:35,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:37,344 INFO L130 PetriNetUnfolder]: 12839/18060 cut-off events. [2022-12-13 21:52:37,344 INFO L131 PetriNetUnfolder]: For 5279/5346 co-relation queries the response was YES. [2022-12-13 21:52:37,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42684 conditions, 18060 events. 12839/18060 cut-off events. For 5279/5346 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 102315 event pairs, 1677 based on Foata normal form. 498/18369 useless extension candidates. Maximal degree in co-relation 42679. Up to 13127 conditions per place. [2022-12-13 21:52:37,412 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 55 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2022-12-13 21:52:37,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 324 flow [2022-12-13 21:52:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:52:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:52:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2022-12-13 21:52:37,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44501718213058417 [2022-12-13 21:52:37,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2022-12-13 21:52:37,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2022-12-13 21:52:37,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:37,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2022-12-13 21:52:37,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 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 21:52:37,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:37,419 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:37,419 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 6 states and 777 transitions. [2022-12-13 21:52:37,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 324 flow [2022-12-13 21:52:37,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:52:37,454 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 133 flow [2022-12-13 21:52:37,455 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-12-13 21:52:37,455 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2022-12-13 21:52:37,455 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 133 flow [2022-12-13 21:52:37,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 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 21:52:37,456 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:37,456 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:37,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:52:37,456 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash -228368940, now seen corresponding path program 1 times [2022-12-13 21:52:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:37,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605832437] [2022-12-13 21:52:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:37,784 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 21:52:37,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:37,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605832437] [2022-12-13 21:52:37,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605832437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:37,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:37,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:52:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443715928] [2022-12-13 21:52:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:52:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:52:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:52:37,897 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2022-12-13 21:52:37,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 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 21:52:37,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:37,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2022-12-13 21:52:37,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:39,552 INFO L130 PetriNetUnfolder]: 9725/13781 cut-off events. [2022-12-13 21:52:39,552 INFO L131 PetriNetUnfolder]: For 3952/4233 co-relation queries the response was YES. [2022-12-13 21:52:39,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31313 conditions, 13781 events. 9725/13781 cut-off events. For 3952/4233 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 77873 event pairs, 3867 based on Foata normal form. 330/13644 useless extension candidates. Maximal degree in co-relation 31307. Up to 12724 conditions per place. [2022-12-13 21:52:39,619 INFO L137 encePairwiseOnDemand]: 286/291 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2022-12-13 21:52:39,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 253 flow [2022-12-13 21:52:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:52:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:52:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2022-12-13 21:52:39,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43012600229095077 [2022-12-13 21:52:39,621 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2022-12-13 21:52:39,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2022-12-13 21:52:39,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:39,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2022-12-13 21:52:39,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 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 21:52:39,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:39,625 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:39,625 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 133 flow. Second operand 6 states and 751 transitions. [2022-12-13 21:52:39,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 253 flow [2022-12-13 21:52:39,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 241 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 21:52:39,628 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 117 flow [2022-12-13 21:52:39,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2022-12-13 21:52:39,629 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2022-12-13 21:52:39,629 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 117 flow [2022-12-13 21:52:39,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 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 21:52:39,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:39,629 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:39,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:52:39,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1431337371, now seen corresponding path program 1 times [2022-12-13 21:52:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:39,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623650866] [2022-12-13 21:52:39,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:39,735 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 21:52:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:39,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623650866] [2022-12-13 21:52:39,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623650866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:39,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:39,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:52:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774758195] [2022-12-13 21:52:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:52:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:39,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:52:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:52:39,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 21:52:39,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 21:52:39,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:39,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 21:52:39,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:40,835 INFO L130 PetriNetUnfolder]: 8390/12395 cut-off events. [2022-12-13 21:52:40,835 INFO L131 PetriNetUnfolder]: For 2236/2480 co-relation queries the response was YES. [2022-12-13 21:52:40,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27820 conditions, 12395 events. 8390/12395 cut-off events. For 2236/2480 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 76601 event pairs, 1595 based on Foata normal form. 942/12957 useless extension candidates. Maximal degree in co-relation 27814. Up to 5298 conditions per place. [2022-12-13 21:52:40,884 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 57 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2022-12-13 21:52:40,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 346 flow [2022-12-13 21:52:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:52:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:52:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-12-13 21:52:40,886 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49742268041237114 [2022-12-13 21:52:40,886 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-12-13 21:52:40,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-12-13 21:52:40,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:40,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-12-13 21:52:40,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 21:52:40,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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 21:52:40,889 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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 21:52:40,889 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 117 flow. Second operand 4 states and 579 transitions. [2022-12-13 21:52:40,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 346 flow [2022-12-13 21:52:40,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:52:40,892 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 156 flow [2022-12-13 21:52:40,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-12-13 21:52:40,892 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2022-12-13 21:52:40,893 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 156 flow [2022-12-13 21:52:40,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 21:52:40,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:40,893 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:40,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:52:40,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1301936397, now seen corresponding path program 1 times [2022-12-13 21:52:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:40,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998165102] [2022-12-13 21:52:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:41,014 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 21:52:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:41,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998165102] [2022-12-13 21:52:41,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998165102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:41,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:52:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804581061] [2022-12-13 21:52:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:41,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:41,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 291 [2022-12-13 21:52:41,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 21:52:41,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:41,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 291 [2022-12-13 21:52:41,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:41,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, 42#P1EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 70#L768true, 41#L808true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse, 121#L881true]) [2022-12-13 21:52:41,695 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 21:52:41,695 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:52:41,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:52:41,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 21:52:41,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 42#P1EXITtrue, P0Thread1of1ForFork2InUse, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 156#L815true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse, 121#L881true]) [2022-12-13 21:52:41,794 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,794 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,795 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,795 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, 42#P1EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 41#L808true, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 12#L889true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:41,797 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,797 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,797 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,797 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 21:52:41,913 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 42#P1EXITtrue, P0Thread1of1ForFork2InUse, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 74#P2EXITtrue, 194#true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse, 121#L881true]) [2022-12-13 21:52:41,913 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,913 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,913 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,913 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,914 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 42#P1EXITtrue, P0Thread1of1ForFork2InUse, 70#L768true, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 166#true, 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 156#L815true, 12#L889true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:41,914 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,914 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,914 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,914 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,916 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_22 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EAX~0_12 1) (= v_~__unbuffered_p2_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~y~0_15 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][55], [P1Thread1of1ForFork0InUse, 42#P1EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 41#L808true, 79#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 138#L831true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:41,916 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-13 21:52:41,916 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:52:41,917 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:52:41,917 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-13 21:52:41,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, 42#P1EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 41#L808true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 12#L889true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 68#L775true, P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:41,940 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,940 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,940 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,940 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 21:52:41,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_22 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EAX~0_12 1) (= v_~__unbuffered_p2_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~y~0_15 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][55], [P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 42#P1EXITtrue, P0Thread1of1ForFork2InUse, 41#L808true, 79#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 138#L831true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 68#L775true, P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:41,992 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-13 21:52:41,992 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 21:52:41,992 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 21:52:41,992 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 21:52:42,012 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L831-->L847: Formula: (let ((.cse11 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse7 .cse11)) (.cse12 (= (mod v_~b$w_buff0_used~0_152 256) 0)) (.cse4 (and .cse7 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse5 (or .cse2 .cse12 .cse4)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~b~0_93 (ite .cse6 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~b$w_buff0_used~0_151 256) 0)) (.cse8 (= (mod v_~b$w_buff1_used~0_132 256) 0))) (and (= v_~weak$$choice0~0_5 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= v_~b$flush_delayed~0_25 0) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse3 .cse4) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= v_~b$w_buff0_used~0_151 (ite .cse1 v_~b$w_buff0_used~0_152 (ite .cse5 v_~b$w_buff0_used~0_152 (ite .cse6 0 v_~b$w_buff0_used~0_152)))) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b~0_92 (ite .cse1 v_~b$mem_tmp~0_18 .cse0)) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse1 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse9 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= (ite .cse1 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse10 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or .cse3 (and .cse10 .cse8) (and .cse10 .cse11))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_152, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_151, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][44], [P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 42#P1EXITtrue, P0Thread1of1ForFork2InUse, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 81#L847true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 74#P2EXITtrue, 194#true, 12#L889true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:42,012 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 21:52:42,012 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 21:52:42,012 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 21:52:42,012 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 21:52:42,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_22 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EAX~0_12 1) (= v_~__unbuffered_p2_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~y~0_15 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][55], [P1Thread1of1ForFork0InUse, 42#P1EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 79#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 156#L815true, 194#true, 138#L831true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:42,013 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-12-13 21:52:42,013 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 21:52:42,013 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 21:52:42,013 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-13 21:52:42,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([589] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_22 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_12 0) (= v_~__unbuffered_p3_EAX~0_12 1) (= v_~__unbuffered_p2_EAX~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~y~0_15 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][55], [P1Thread1of1ForFork0InUse, 42#P1EXITtrue, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 79#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 70#L768true, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 166#true, Black: 197#(= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 74#P2EXITtrue, 194#true, 138#L831true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P2Thread1of1ForFork3InUse]) [2022-12-13 21:52:42,082 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-12-13 21:52:42,082 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 21:52:42,082 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 21:52:42,082 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-13 21:52:42,144 INFO L130 PetriNetUnfolder]: 9106/13595 cut-off events. [2022-12-13 21:52:42,144 INFO L131 PetriNetUnfolder]: For 6418/6765 co-relation queries the response was YES. [2022-12-13 21:52:42,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37891 conditions, 13595 events. 9106/13595 cut-off events. For 6418/6765 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 83501 event pairs, 2606 based on Foata normal form. 32/13404 useless extension candidates. Maximal degree in co-relation 37883. Up to 12386 conditions per place. [2022-12-13 21:52:42,197 INFO L137 encePairwiseOnDemand]: 287/291 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2022-12-13 21:52:42,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 337 flow [2022-12-13 21:52:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-12-13 21:52:42,199 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5085910652920962 [2022-12-13 21:52:42,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-12-13 21:52:42,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-12-13 21:52:42,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:42,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-12-13 21:52:42,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 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 21:52:42,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:42,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:42,202 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 156 flow. Second operand 3 states and 444 transitions. [2022-12-13 21:52:42,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 337 flow [2022-12-13 21:52:42,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:52:42,205 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 189 flow [2022-12-13 21:52:42,205 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-13 21:52:42,205 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2022-12-13 21:52:42,205 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 189 flow [2022-12-13 21:52:42,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 21:52:42,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:42,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:42,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:52:42,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash 473033647, now seen corresponding path program 1 times [2022-12-13 21:52:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:42,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912989050] [2022-12-13 21:52:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:42,317 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 21:52:42,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912989050] [2022-12-13 21:52:42,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912989050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:42,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:42,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:52:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657417505] [2022-12-13 21:52:42,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:42,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:52:42,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:42,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:52:42,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:52:42,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-12-13 21:52:42,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 21:52:42,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:42,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-12-13 21:52:42,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:44,024 INFO L130 PetriNetUnfolder]: 14565/20664 cut-off events. [2022-12-13 21:52:44,024 INFO L131 PetriNetUnfolder]: For 15502/15502 co-relation queries the response was YES. [2022-12-13 21:52:44,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60675 conditions, 20664 events. 14565/20664 cut-off events. For 15502/15502 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 119714 event pairs, 804 based on Foata normal form. 204/20868 useless extension candidates. Maximal degree in co-relation 60666. Up to 9179 conditions per place. [2022-12-13 21:52:44,081 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 85 selfloop transitions, 20 changer transitions 4/109 dead transitions. [2022-12-13 21:52:44,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 109 transitions, 684 flow [2022-12-13 21:52:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:52:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:52:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2022-12-13 21:52:44,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4859106529209622 [2022-12-13 21:52:44,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2022-12-13 21:52:44,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2022-12-13 21:52:44,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:44,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2022-12-13 21:52:44,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 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 21:52:44,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 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 21:52:44,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 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 21:52:44,086 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 189 flow. Second operand 5 states and 707 transitions. [2022-12-13 21:52:44,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 109 transitions, 684 flow [2022-12-13 21:52:44,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:52:44,093 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 323 flow [2022-12-13 21:52:44,093 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-12-13 21:52:44,093 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2022-12-13 21:52:44,094 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 323 flow [2022-12-13 21:52:44,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 21:52:44,094 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:44,094 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 21:52:44,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:52:44,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash 375033373, now seen corresponding path program 1 times [2022-12-13 21:52:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:44,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146307748] [2022-12-13 21:52:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:44,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:52:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:44,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146307748] [2022-12-13 21:52:44,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146307748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:44,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:44,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:52:44,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528576656] [2022-12-13 21:52:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:44,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:52:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:52:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:52:44,188 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 291 [2022-12-13 21:52:44,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 21:52:44,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:44,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 291 [2022-12-13 21:52:44,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:45,730 INFO L130 PetriNetUnfolder]: 11151/16726 cut-off events. [2022-12-13 21:52:45,731 INFO L131 PetriNetUnfolder]: For 21311/22266 co-relation queries the response was YES. [2022-12-13 21:52:45,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52299 conditions, 16726 events. 11151/16726 cut-off events. For 21311/22266 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 107231 event pairs, 4689 based on Foata normal form. 343/16794 useless extension candidates. Maximal degree in co-relation 52287. Up to 8469 conditions per place. [2022-12-13 21:52:45,788 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 55 selfloop transitions, 8 changer transitions 3/76 dead transitions. [2022-12-13 21:52:45,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 552 flow [2022-12-13 21:52:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:52:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:52:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-12-13 21:52:45,790 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5108820160366552 [2022-12-13 21:52:45,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-12-13 21:52:45,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-12-13 21:52:45,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:45,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-12-13 21:52:45,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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 21:52:45,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:45,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 21:52:45,792 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 323 flow. Second operand 3 states and 446 transitions. [2022-12-13 21:52:45,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 552 flow [2022-12-13 21:52:45,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 538 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 21:52:45,810 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 326 flow [2022-12-13 21:52:45,810 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-12-13 21:52:45,811 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2022-12-13 21:52:45,811 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 326 flow [2022-12-13 21:52:45,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 21:52:45,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:45,811 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 21:52:45,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:52:45,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 859338337, now seen corresponding path program 1 times [2022-12-13 21:52:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:45,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916331819] [2022-12-13 21:52:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:45,928 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 21:52:45,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:45,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916331819] [2022-12-13 21:52:45,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916331819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:45,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:45,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:52:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558143340] [2022-12-13 21:52:45,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:45,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:52:45,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:45,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:52:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:52:45,938 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 21:52:45,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 21:52:45,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:45,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 21:52:45,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:47,077 INFO L130 PetriNetUnfolder]: 6731/10652 cut-off events. [2022-12-13 21:52:47,077 INFO L131 PetriNetUnfolder]: For 11064/11882 co-relation queries the response was YES. [2022-12-13 21:52:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31436 conditions, 10652 events. 6731/10652 cut-off events. For 11064/11882 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 71270 event pairs, 791 based on Foata normal form. 1241/11707 useless extension candidates. Maximal degree in co-relation 31423. Up to 3887 conditions per place. [2022-12-13 21:52:47,110 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 90 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2022-12-13 21:52:47,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 115 transitions, 850 flow [2022-12-13 21:52:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:52:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:52:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2022-12-13 21:52:47,112 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49896907216494846 [2022-12-13 21:52:47,112 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2022-12-13 21:52:47,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2022-12-13 21:52:47,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:47,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2022-12-13 21:52:47,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 21:52:47,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 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 21:52:47,115 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 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 21:52:47,115 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 326 flow. Second operand 5 states and 726 transitions. [2022-12-13 21:52:47,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 115 transitions, 850 flow [2022-12-13 21:52:47,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 115 transitions, 795 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 21:52:47,121 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 370 flow [2022-12-13 21:52:47,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2022-12-13 21:52:47,122 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2022-12-13 21:52:47,122 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 370 flow [2022-12-13 21:52:47,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 21:52:47,122 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:47,122 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] [2022-12-13 21:52:47,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:52:47,122 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash 176642446, now seen corresponding path program 1 times [2022-12-13 21:52:47,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:47,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645090225] [2022-12-13 21:52:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:47,276 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 21:52:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:47,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645090225] [2022-12-13 21:52:47,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645090225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:47,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:47,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:52:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674086623] [2022-12-13 21:52:47,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:47,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:52:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:47,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:52:47,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:52:47,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 21:52:47,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 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 21:52:47,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:47,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 21:52:47,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:48,353 INFO L130 PetriNetUnfolder]: 5987/9511 cut-off events. [2022-12-13 21:52:48,353 INFO L131 PetriNetUnfolder]: For 14692/15372 co-relation queries the response was YES. [2022-12-13 21:52:48,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32618 conditions, 9511 events. 5987/9511 cut-off events. For 14692/15372 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 63036 event pairs, 769 based on Foata normal form. 590/9921 useless extension candidates. Maximal degree in co-relation 32604. Up to 3887 conditions per place. [2022-12-13 21:52:48,380 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 100 selfloop transitions, 14 changer transitions 2/131 dead transitions. [2022-12-13 21:52:48,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 956 flow [2022-12-13 21:52:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:52:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:52:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions. [2022-12-13 21:52:48,382 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49942726231386025 [2022-12-13 21:52:48,382 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 872 transitions. [2022-12-13 21:52:48,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 872 transitions. [2022-12-13 21:52:48,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:48,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 872 transitions. [2022-12-13 21:52:48,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 21:52:48,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:48,385 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:48,385 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 370 flow. Second operand 6 states and 872 transitions. [2022-12-13 21:52:48,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 956 flow [2022-12-13 21:52:48,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 131 transitions, 940 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 21:52:48,396 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 439 flow [2022-12-13 21:52:48,396 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2022-12-13 21:52:48,396 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2022-12-13 21:52:48,396 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 439 flow [2022-12-13 21:52:48,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 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 21:52:48,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:48,396 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, 1, 1] [2022-12-13 21:52:48,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:52:48,397 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1678816094, now seen corresponding path program 1 times [2022-12-13 21:52:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:48,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218838483] [2022-12-13 21:52:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:48,834 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 21:52:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:48,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218838483] [2022-12-13 21:52:48,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218838483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:48,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:48,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:52:48,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473525140] [2022-12-13 21:52:48,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:48,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:52:48,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:48,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:52:48,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:52:48,874 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 291 [2022-12-13 21:52:48,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 439 flow. Second operand has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 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 21:52:48,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:48,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 291 [2022-12-13 21:52:48,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:50,752 INFO L130 PetriNetUnfolder]: 10663/17028 cut-off events. [2022-12-13 21:52:50,752 INFO L131 PetriNetUnfolder]: For 47953/49238 co-relation queries the response was YES. [2022-12-13 21:52:50,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65322 conditions, 17028 events. 10663/17028 cut-off events. For 47953/49238 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 126468 event pairs, 1699 based on Foata normal form. 316/17112 useless extension candidates. Maximal degree in co-relation 65306. Up to 6233 conditions per place. [2022-12-13 21:52:50,815 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 112 selfloop transitions, 7 changer transitions 56/190 dead transitions. [2022-12-13 21:52:50,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 190 transitions, 1711 flow [2022-12-13 21:52:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:52:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:52:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1004 transitions. [2022-12-13 21:52:50,817 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49288168875797744 [2022-12-13 21:52:50,817 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1004 transitions. [2022-12-13 21:52:50,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1004 transitions. [2022-12-13 21:52:50,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:50,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1004 transitions. [2022-12-13 21:52:50,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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 21:52:50,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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 21:52:50,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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 21:52:50,822 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 439 flow. Second operand 7 states and 1004 transitions. [2022-12-13 21:52:50,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 190 transitions, 1711 flow [2022-12-13 21:52:51,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 190 transitions, 1571 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 21:52:51,106 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 473 flow [2022-12-13 21:52:51,106 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=473, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2022-12-13 21:52:51,106 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2022-12-13 21:52:51,106 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 473 flow [2022-12-13 21:52:51,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 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 21:52:51,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:51,107 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, 1, 1] [2022-12-13 21:52:51,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:52:51,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2038282602, now seen corresponding path program 2 times [2022-12-13 21:52:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:51,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394644434] [2022-12-13 21:52:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:51,275 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 21:52:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:51,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394644434] [2022-12-13 21:52:51,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394644434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:51,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:51,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:52:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561470146] [2022-12-13 21:52:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:51,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:52:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:51,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:52:51,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:52:51,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 21:52:51,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 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 21:52:51,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:51,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 21:52:51,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:52,639 INFO L130 PetriNetUnfolder]: 7600/12366 cut-off events. [2022-12-13 21:52:52,639 INFO L131 PetriNetUnfolder]: For 27523/28217 co-relation queries the response was YES. [2022-12-13 21:52:52,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47082 conditions, 12366 events. 7600/12366 cut-off events. For 27523/28217 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 89824 event pairs, 772 based on Foata normal form. 349/12494 useless extension candidates. Maximal degree in co-relation 47063. Up to 4909 conditions per place. [2022-12-13 21:52:52,688 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 83 selfloop transitions, 18 changer transitions 14/127 dead transitions. [2022-12-13 21:52:52,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 127 transitions, 1012 flow [2022-12-13 21:52:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:52:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:52:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 990 transitions. [2022-12-13 21:52:52,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48600883652430044 [2022-12-13 21:52:52,690 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 990 transitions. [2022-12-13 21:52:52,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 990 transitions. [2022-12-13 21:52:52,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:52,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 990 transitions. [2022-12-13 21:52:52,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.42857142857142) internal successors, (990), 7 states have internal predecessors, (990), 0 states have call successors, (0), 0 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 21:52:52,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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 21:52:52,694 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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 21:52:52,694 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 473 flow. Second operand 7 states and 990 transitions. [2022-12-13 21:52:52,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 127 transitions, 1012 flow [2022-12-13 21:52:53,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 127 transitions, 998 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 21:52:53,100 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 463 flow [2022-12-13 21:52:53,101 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2022-12-13 21:52:53,101 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2022-12-13 21:52:53,101 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 463 flow [2022-12-13 21:52:53,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 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 21:52:53,101 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:53,101 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, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:53,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:52:53,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:53,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1267875000, now seen corresponding path program 1 times [2022-12-13 21:52:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:53,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122332511] [2022-12-13 21:52:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:53,249 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 21:52:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:53,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122332511] [2022-12-13 21:52:53,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122332511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:53,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:53,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:52:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594299849] [2022-12-13 21:52:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:52:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:52:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:52:53,270 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-12-13 21:52:53,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 463 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 21:52:53,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:53,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-12-13 21:52:53,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:54,381 INFO L130 PetriNetUnfolder]: 7167/10932 cut-off events. [2022-12-13 21:52:54,381 INFO L131 PetriNetUnfolder]: For 36217/36217 co-relation queries the response was YES. [2022-12-13 21:52:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46996 conditions, 10932 events. 7167/10932 cut-off events. For 36217/36217 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 64579 event pairs, 2001 based on Foata normal form. 1/10933 useless extension candidates. Maximal degree in co-relation 46977. Up to 5568 conditions per place. [2022-12-13 21:52:54,415 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 71 selfloop transitions, 10 changer transitions 77/158 dead transitions. [2022-12-13 21:52:54,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 158 transitions, 1448 flow [2022-12-13 21:52:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:52:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:52:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 842 transitions. [2022-12-13 21:52:54,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4822451317296678 [2022-12-13 21:52:54,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 842 transitions. [2022-12-13 21:52:54,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 842 transitions. [2022-12-13 21:52:54,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:54,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 842 transitions. [2022-12-13 21:52:54,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 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 21:52:54,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:54,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 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 21:52:54,421 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 463 flow. Second operand 6 states and 842 transitions. [2022-12-13 21:52:54,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 158 transitions, 1448 flow [2022-12-13 21:52:54,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 158 transitions, 1306 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-13 21:52:54,639 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 369 flow [2022-12-13 21:52:54,639 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2022-12-13 21:52:54,640 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2022-12-13 21:52:54,640 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 369 flow [2022-12-13 21:52:54,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 21:52:54,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:54,640 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, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:54,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:52:54,640 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -962468144, now seen corresponding path program 2 times [2022-12-13 21:52:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396546258] [2022-12-13 21:52:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:55,245 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 21:52:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:55,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396546258] [2022-12-13 21:52:55,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396546258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:55,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:55,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:52:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973717405] [2022-12-13 21:52:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:55,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:52:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:52:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:52:55,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-12-13 21:52:55,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 369 flow. Second operand has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 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 21:52:55,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:55,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-12-13 21:52:55,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:55,724 INFO L130 PetriNetUnfolder]: 1407/2345 cut-off events. [2022-12-13 21:52:55,724 INFO L131 PetriNetUnfolder]: For 6578/6727 co-relation queries the response was YES. [2022-12-13 21:52:55,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9521 conditions, 2345 events. 1407/2345 cut-off events. For 6578/6727 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13024 event pairs, 429 based on Foata normal form. 57/2368 useless extension candidates. Maximal degree in co-relation 9502. Up to 957 conditions per place. [2022-12-13 21:52:55,731 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 64 selfloop transitions, 5 changer transitions 59/139 dead transitions. [2022-12-13 21:52:55,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 139 transitions, 1189 flow [2022-12-13 21:52:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:52:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:52:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 985 transitions. [2022-12-13 21:52:55,732 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4835542464408444 [2022-12-13 21:52:55,732 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 985 transitions. [2022-12-13 21:52:55,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 985 transitions. [2022-12-13 21:52:55,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:55,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 985 transitions. [2022-12-13 21:52:55,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.71428571428572) internal successors, (985), 7 states have internal predecessors, (985), 0 states have call successors, (0), 0 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 21:52:55,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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 21:52:55,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 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 21:52:55,738 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 369 flow. Second operand 7 states and 985 transitions. [2022-12-13 21:52:55,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 139 transitions, 1189 flow [2022-12-13 21:52:55,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 139 transitions, 892 flow, removed 25 selfloop flow, removed 15 redundant places. [2022-12-13 21:52:55,774 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 298 flow [2022-12-13 21:52:55,774 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2022-12-13 21:52:55,775 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2022-12-13 21:52:55,775 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 298 flow [2022-12-13 21:52:55,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 0 states have call successors, (0), 0 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 21:52:55,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:55,775 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, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:55,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:52:55,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:55,776 INFO L85 PathProgramCache]: Analyzing trace with hash 640352192, now seen corresponding path program 3 times [2022-12-13 21:52:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:55,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053855525] [2022-12-13 21:52:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:55,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:52:55,898 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 21:52:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:52:55,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053855525] [2022-12-13 21:52:55,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053855525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:52:55,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:52:55,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:52:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409092612] [2022-12-13 21:52:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:52:55,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:52:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:52:55,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:52:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:52:55,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 291 [2022-12-13 21:52:55,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 21:52:55,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:52:55,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 291 [2022-12-13 21:52:55,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:52:56,203 INFO L130 PetriNetUnfolder]: 1214/2016 cut-off events. [2022-12-13 21:52:56,203 INFO L131 PetriNetUnfolder]: For 4221/4254 co-relation queries the response was YES. [2022-12-13 21:52:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2016 events. 1214/2016 cut-off events. For 4221/4254 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10006 event pairs, 399 based on Foata normal form. 20/2027 useless extension candidates. Maximal degree in co-relation 6754. Up to 750 conditions per place. [2022-12-13 21:52:56,209 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 44 selfloop transitions, 1 changer transitions 47/95 dead transitions. [2022-12-13 21:52:56,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 665 flow [2022-12-13 21:52:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:52:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:52:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2022-12-13 21:52:56,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49828178694158076 [2022-12-13 21:52:56,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2022-12-13 21:52:56,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2022-12-13 21:52:56,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:52:56,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2022-12-13 21:52:56,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 21:52:56,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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 21:52:56,212 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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 21:52:56,212 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 298 flow. Second operand 4 states and 580 transitions. [2022-12-13 21:52:56,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 665 flow [2022-12-13 21:52:56,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 627 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 21:52:56,216 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 191 flow [2022-12-13 21:52:56,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2022-12-13 21:52:56,216 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2022-12-13 21:52:56,216 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 191 flow [2022-12-13 21:52:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 21:52:56,216 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:52:56,217 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, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:56,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:52:56,217 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:52:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:52:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1322510634, now seen corresponding path program 4 times [2022-12-13 21:52:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:52:56,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744843042] [2022-12-13 21:52:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:52:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:52:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:52:56,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:52:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:52:56,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:52:56,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:52:56,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 21:52:56,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 21:52:56,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 21:52:56,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 21:52:56,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 21:52:56,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 21:52:56,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 21:52:56,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:52:56,297 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:52:56,301 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:52:56,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:52:56,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:52:56 BasicIcfg [2022-12-13 21:52:56,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:52:56,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:52:56,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:52:56,347 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:52:56,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:52:25" (3/4) ... [2022-12-13 21:52:56,349 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:52:56,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:52:56,350 INFO L158 Benchmark]: Toolchain (without parser) took 31722.45ms. Allocated memory was 119.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 81.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 627.2MB. Max. memory is 16.1GB. [2022-12-13 21:52:56,350 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 119.5MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:52:56,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.62ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 53.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 21:52:56,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.83ms. Allocated memory is still 119.5MB. Free memory was 53.1MB in the beginning and 50.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:52:56,350 INFO L158 Benchmark]: Boogie Preprocessor took 22.61ms. Allocated memory is still 119.5MB. Free memory was 50.6MB in the beginning and 48.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:52:56,351 INFO L158 Benchmark]: RCFGBuilder took 588.31ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 48.5MB in the beginning and 82.1MB in the end (delta: -33.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-12-13 21:52:56,351 INFO L158 Benchmark]: TraceAbstraction took 30700.64ms. Allocated memory was 144.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 81.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 598.9MB. Max. memory is 16.1GB. [2022-12-13 21:52:56,351 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 1.8GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:52:56,352 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.18ms. Allocated memory is still 119.5MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.62ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 53.1MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.83ms. Allocated memory is still 119.5MB. Free memory was 53.1MB in the beginning and 50.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.61ms. Allocated memory is still 119.5MB. Free memory was 50.6MB in the beginning and 48.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.31ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 48.5MB in the beginning and 82.1MB in the end (delta: -33.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30700.64ms. Allocated memory was 144.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 81.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 598.9MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 1.8GB. Free memory is still 1.1GB. 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.5s, 159 PlacesBefore, 52 PlacesAfterwards, 148 TransitionsBefore, 39 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 11243 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5204, independent: 4929, independent conditional: 0, independent unconditional: 4929, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2082, independent: 2028, independent conditional: 0, independent unconditional: 2028, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5204, independent: 2901, independent conditional: 0, independent unconditional: 2901, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 2082, unknown conditional: 0, unknown unconditional: 2082] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-1, t1025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=0, t1025={5:0}, t1026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1027; [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=1, t1025={5:0}, t1026={6:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=2, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 [L827] 4 a = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={5:0}, t1026={6:0}, t1027={7:0}, t1028={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 878]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 16 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: 30.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1190 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1004 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2413 IncrementalHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 72 mSDtfsCounter, 2413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=12, InterpolantAutomatonStates: 77, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 2334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 21:52:56,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- 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 21:52:57,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:52:57,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:52:57,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:52:57,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:52:57,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:52:57,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:52:57,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:52:57,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:52:57,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:52:57,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:52:57,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:52:57,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:52:57,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:52:57,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:52:57,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:52:57,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:52:57,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:52:57,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:52:57,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:52:57,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:52:57,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:52:57,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:52:57,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:52:57,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:52:57,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:52:57,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:52:57,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:52:57,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:52:57,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:52:57,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:52:57,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:52:57,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:52:57,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:52:57,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:52:57,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:52:58,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:52:58,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:52:58,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:52:58,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:52:58,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:52:58,002 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 21:52:58,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:52:58,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:52:58,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:52:58,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:52:58,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:52:58,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:52:58,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:52:58,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:52:58,019 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:52:58,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:52:58,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:52:58,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 21:52:58,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 21:52:58,020 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 21:52:58,021 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 21:52:58,021 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:52:58,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:52:58,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:52:58,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:52:58,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:52:58,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:52:58,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:52:58,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:52:58,022 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 21:52:58,028 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 21:52:58,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:52:58,028 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:52:58,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:52:58,029 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 21:52:58,029 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:52:58,029 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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2022-12-13 21:52:58,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:52:58,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:52:58,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:52:58,268 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:52:58,269 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:52:58,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-12-13 21:53:00,779 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:53:00,984 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:53:00,985 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2022-12-13 21:53:00,997 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data/ade01a2bd/868bf7f943084d77bdab7db5943ebbe8/FLAG3dc3c91cf [2022-12-13 21:53:01,010 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/data/ade01a2bd/868bf7f943084d77bdab7db5943ebbe8 [2022-12-13 21:53:01,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:53:01,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:53:01,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:53:01,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:53:01,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:53:01,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a94f69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01, skipping insertion in model container [2022-12-13 21:53:01,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:53:01,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:53:01,160 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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-12-13 21:53:01,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:53:01,323 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:53:01,336 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_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/sv-benchmarks/c/pthread-wmm/mix039.oepc.i[945,958] [2022-12-13 21:53:01,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:53:01,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:53:01,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:53:01,419 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:53:01,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01 WrapperNode [2022-12-13 21:53:01,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:53:01,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:53:01,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:53:01,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:53:01,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,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 09:53:01" (1/1) ... [2022-12-13 21:53:01,468 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 21:53:01,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:53:01,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:53:01,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:53:01,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:53:01,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,497 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:53:01,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:53:01,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:53:01,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:53:01,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (1/1) ... [2022-12-13 21:53:01,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:53:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:53:01,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:53:01,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 21:53:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:53:01,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:53:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:53:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:53:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:53:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:53:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 21:53:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 21:53:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:53:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:53:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:53:01,562 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 21:53:01,686 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:53:01,688 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:53:01,997 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:53:02,071 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:53:02,071 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:53:02,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:02 BoogieIcfgContainer [2022-12-13 21:53:02,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:53:02,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:53:02,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:53:02,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:53:02,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:53:01" (1/3) ... [2022-12-13 21:53:02,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1115b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:53:02, skipping insertion in model container [2022-12-13 21:53:02,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:53:01" (2/3) ... [2022-12-13 21:53:02,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1115b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:53:02, skipping insertion in model container [2022-12-13 21:53:02,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:02" (3/3) ... [2022-12-13 21:53:02,079 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2022-12-13 21:53:02,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:53:02,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 21:53:02,093 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:53:02,139 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:53:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 153 transitions, 326 flow [2022-12-13 21:53:02,205 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-12-13 21:53:02,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:02,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 21:53:02,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 153 transitions, 326 flow [2022-12-13 21:53:02,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 149 transitions, 310 flow [2022-12-13 21:53:02,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:53:02,224 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 310 flow [2022-12-13 21:53:02,227 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 310 flow [2022-12-13 21:53:02,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 310 flow [2022-12-13 21:53:02,253 INFO L130 PetriNetUnfolder]: 2/149 cut-off events. [2022-12-13 21:53:02,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:02,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 2/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 21:53:02,255 INFO L119 LiptonReduction]: Number of co-enabled transitions 3884 [2022-12-13 21:53:09,152 INFO L134 LiptonReduction]: Checked pairs total: 10868 [2022-12-13 21:53:09,152 INFO L136 LiptonReduction]: Total number of compositions: 140 [2022-12-13 21:53:09,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:53:09,172 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;@6dbcd993, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:53:09,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 21:53:09,173 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 21:53:09,173 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:09,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:09,174 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 21:53:09,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 634, now seen corresponding path program 1 times [2022-12-13 21:53:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:09,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283560464] [2022-12-13 21:53:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:09,187 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 21:53:09,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:09,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:09,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:09,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 21:53:09,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:09,251 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 21:53:09,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:09,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:09,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283560464] [2022-12-13 21:53:09,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283560464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:09,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:09,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 21:53:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914551612] [2022-12-13 21:53:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:09,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:53:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:09,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:53:09,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:53:09,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 293 [2022-12-13 21:53:09,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 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 21:53:09,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:09,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 293 [2022-12-13 21:53:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:10,820 INFO L130 PetriNetUnfolder]: 9959/13469 cut-off events. [2022-12-13 21:53:10,820 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 21:53:10,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27057 conditions, 13469 events. 9959/13469 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 70901 event pairs, 9959 based on Foata normal form. 400/11845 useless extension candidates. Maximal degree in co-relation 27045. Up to 13371 conditions per place. [2022-12-13 21:53:10,878 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-12-13 21:53:10,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 136 flow [2022-12-13 21:53:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:53:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 21:53:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 314 transitions. [2022-12-13 21:53:10,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5358361774744027 [2022-12-13 21:53:10,889 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 314 transitions. [2022-12-13 21:53:10,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 314 transitions. [2022-12-13 21:53:10,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:10,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 314 transitions. [2022-12-13 21:53:10,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 157.0) internal successors, (314), 2 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 21:53:10,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 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 21:53:10,899 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 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 21:53:10,901 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 314 transitions. [2022-12-13 21:53:10,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 136 flow [2022-12-13 21:53:10,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 21:53:10,906 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-12-13 21:53:10,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 21:53:10,911 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 21:53:10,911 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-12-13 21:53:10,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 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 21:53:10,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:10,911 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:53:10,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:11,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:11,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash 623110, now seen corresponding path program 1 times [2022-12-13 21:53:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:11,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183745415] [2022-12-13 21:53:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:11,138 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 21:53:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:11,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:11,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:11,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:53:11,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:53:11,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:11,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:11,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183745415] [2022-12-13 21:53:11,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183745415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:11,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:11,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:53:11,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63153570] [2022-12-13 21:53:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:11,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:53:11,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:11,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:53:11,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:53:11,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 293 [2022-12-13 21:53:11,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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 21:53:11,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:11,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 293 [2022-12-13 21:53:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:12,424 INFO L130 PetriNetUnfolder]: 7831/10658 cut-off events. [2022-12-13 21:53:12,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:53:12,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21391 conditions, 10658 events. 7831/10658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 54055 event pairs, 4023 based on Foata normal form. 0/9670 useless extension candidates. Maximal degree in co-relation 21388. Up to 8431 conditions per place. [2022-12-13 21:53:12,461 INFO L137 encePairwiseOnDemand]: 290/293 looper letters, 45 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2022-12-13 21:53:12,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 226 flow [2022-12-13 21:53:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:53:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:53:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-12-13 21:53:12,464 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5267349260523322 [2022-12-13 21:53:12,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2022-12-13 21:53:12,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2022-12-13 21:53:12,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:12,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2022-12-13 21:53:12,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 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 21:53:12,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 21:53:12,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 21:53:12,467 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 463 transitions. [2022-12-13 21:53:12,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 226 flow [2022-12-13 21:53:12,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:53:12,468 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2022-12-13 21:53:12,468 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 21:53:12,469 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 21:53:12,469 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2022-12-13 21:53:12,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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 21:53:12,469 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:12,469 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:12,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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)] Forceful destruction successful, exit code 0 [2022-12-13 21:53:12,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:12,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1718386932, now seen corresponding path program 1 times [2022-12-13 21:53:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443368831] [2022-12-13 21:53:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:12,675 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 21:53:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:12,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:12,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:12,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:53:12,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:12,780 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 21:53:12,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:12,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:12,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443368831] [2022-12-13 21:53:12,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443368831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:12,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:12,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345032107] [2022-12-13 21:53:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:12,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:12,796 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 293 [2022-12-13 21:53:12,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 21:53:12,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:12,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 293 [2022-12-13 21:53:12,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:13,422 INFO L130 PetriNetUnfolder]: 4483/6404 cut-off events. [2022-12-13 21:53:13,422 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-12-13 21:53:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 6404 events. 4483/6404 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34864 event pairs, 655 based on Foata normal form. 320/6469 useless extension candidates. Maximal degree in co-relation 13349. Up to 3781 conditions per place. [2022-12-13 21:53:13,440 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 52 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2022-12-13 21:53:13,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 266 flow [2022-12-13 21:53:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:53:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:53:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2022-12-13 21:53:13,442 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4991467576791809 [2022-12-13 21:53:13,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2022-12-13 21:53:13,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2022-12-13 21:53:13,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:13,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2022-12-13 21:53:13,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 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 21:53:13,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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 21:53:13,446 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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 21:53:13,446 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 4 states and 585 transitions. [2022-12-13 21:53:13,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 266 flow [2022-12-13 21:53:13,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:13,447 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 110 flow [2022-12-13 21:53:13,448 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 21:53:13,448 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2022-12-13 21:53:13,448 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 110 flow [2022-12-13 21:53:13,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 21:53:13,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:13,449 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:13,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:13,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:13,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1441411893, now seen corresponding path program 1 times [2022-12-13 21:53:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:13,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448238636] [2022-12-13 21:53:13,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:13,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 21:53:13,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:13,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:13,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:13,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:53:13,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:13,773 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 21:53:13,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:13,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:13,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448238636] [2022-12-13 21:53:13,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448238636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:13,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:13,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:53:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693403909] [2022-12-13 21:53:13,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:13,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:13,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:13,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 293 [2022-12-13 21:53:13,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 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 21:53:13,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:13,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 293 [2022-12-13 21:53:13,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:14,260 INFO L130 PetriNetUnfolder]: 2161/3299 cut-off events. [2022-12-13 21:53:14,260 INFO L131 PetriNetUnfolder]: For 957/957 co-relation queries the response was YES. [2022-12-13 21:53:14,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 3299 events. 2161/3299 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17383 event pairs, 328 based on Foata normal form. 212/3418 useless extension candidates. Maximal degree in co-relation 8300. Up to 1081 conditions per place. [2022-12-13 21:53:14,270 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 65 selfloop transitions, 10 changer transitions 1/80 dead transitions. [2022-12-13 21:53:14,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 383 flow [2022-12-13 21:53:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2022-12-13 21:53:14,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5003412969283276 [2022-12-13 21:53:14,273 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2022-12-13 21:53:14,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2022-12-13 21:53:14,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:14,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2022-12-13 21:53:14,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 21:53:14,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 21:53:14,277 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 21:53:14,278 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 110 flow. Second operand 5 states and 733 transitions. [2022-12-13 21:53:14,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 383 flow [2022-12-13 21:53:14,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 372 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:53:14,281 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 162 flow [2022-12-13 21:53:14,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-13 21:53:14,281 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-12-13 21:53:14,282 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 162 flow [2022-12-13 21:53:14,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 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 21:53:14,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:14,282 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] [2022-12-13 21:53:14,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:14,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:14,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1969689795, now seen corresponding path program 1 times [2022-12-13 21:53:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:14,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211941223] [2022-12-13 21:53:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:14,484 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 21:53:14,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:14,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:14,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:14,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 21:53:14,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:14,612 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 21:53:14,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:14,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211941223] [2022-12-13 21:53:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211941223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:14,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:14,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:53:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130292940] [2022-12-13 21:53:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:53:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:53:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:53:14,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 293 [2022-12-13 21:53:14,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 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 21:53:14,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:14,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 293 [2022-12-13 21:53:14,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:15,100 INFO L130 PetriNetUnfolder]: 1189/1877 cut-off events. [2022-12-13 21:53:15,100 INFO L131 PetriNetUnfolder]: For 1589/1589 co-relation queries the response was YES. [2022-12-13 21:53:15,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 1877 events. 1189/1877 cut-off events. For 1589/1589 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9227 event pairs, 326 based on Foata normal form. 77/1924 useless extension candidates. Maximal degree in co-relation 5401. Up to 630 conditions per place. [2022-12-13 21:53:15,107 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 76 selfloop transitions, 14 changer transitions 1/95 dead transitions. [2022-12-13 21:53:15,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 506 flow [2022-12-13 21:53:15,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:53:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:53:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2022-12-13 21:53:15,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 21:53:15,110 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2022-12-13 21:53:15,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2022-12-13 21:53:15,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:15,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2022-12-13 21:53:15,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 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 21:53:15,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 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 21:53:15,115 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 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 21:53:15,115 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 162 flow. Second operand 6 states and 879 transitions. [2022-12-13 21:53:15,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 506 flow [2022-12-13 21:53:15,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 476 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 21:53:15,126 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 212 flow [2022-12-13 21:53:15,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-12-13 21:53:15,127 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-13 21:53:15,127 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 212 flow [2022-12-13 21:53:15,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 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 21:53:15,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:15,128 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, 1, 1] [2022-12-13 21:53:15,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:15,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:15,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash -40595431, now seen corresponding path program 1 times [2022-12-13 21:53:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:15,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295230959] [2022-12-13 21:53:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:15,330 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 21:53:15,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:15,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:15,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:15,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 21:53:15,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:15,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 21:53:15,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:15,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:15,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295230959] [2022-12-13 21:53:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295230959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:15,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:15,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:53:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476983493] [2022-12-13 21:53:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:15,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:53:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:53:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:53:15,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 293 [2022-12-13 21:53:15,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 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 21:53:15,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:15,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 293 [2022-12-13 21:53:15,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:16,063 INFO L130 PetriNetUnfolder]: 1011/1571 cut-off events. [2022-12-13 21:53:16,063 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2022-12-13 21:53:16,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 1571 events. 1011/1571 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7518 event pairs, 326 based on Foata normal form. 14/1568 useless extension candidates. Maximal degree in co-relation 4605. Up to 630 conditions per place. [2022-12-13 21:53:16,071 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 59 selfloop transitions, 18 changer transitions 1/82 dead transitions. [2022-12-13 21:53:16,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 464 flow [2022-12-13 21:53:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:53:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:53:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 997 transitions. [2022-12-13 21:53:16,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48610433934666014 [2022-12-13 21:53:16,075 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 997 transitions. [2022-12-13 21:53:16,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 997 transitions. [2022-12-13 21:53:16,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:16,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 997 transitions. [2022-12-13 21:53:16,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.42857142857142) internal successors, (997), 7 states have internal predecessors, (997), 0 states have call successors, (0), 0 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 21:53:16,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 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 21:53:16,080 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 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 21:53:16,080 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 212 flow. Second operand 7 states and 997 transitions. [2022-12-13 21:53:16,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 464 flow [2022-12-13 21:53:16,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 418 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 21:53:16,091 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2022-12-13 21:53:16,092 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 21:53:16,092 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2022-12-13 21:53:16,092 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 222 flow [2022-12-13 21:53:16,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 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 21:53:16,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:16,093 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:16,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:16,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:16,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1526878688, now seen corresponding path program 1 times [2022-12-13 21:53:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:16,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608340588] [2022-12-13 21:53:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:16,299 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 21:53:16,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:16,303 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:16,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:16,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 21:53:16,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:16,814 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 21:53:16,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:16,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:16,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608340588] [2022-12-13 21:53:16,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608340588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:16,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:16,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:53:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392875340] [2022-12-13 21:53:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:16,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:53:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:53:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:53:16,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 293 [2022-12-13 21:53:16,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 222 flow. Second operand has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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 21:53:16,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:16,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 293 [2022-12-13 21:53:16,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:17,464 INFO L130 PetriNetUnfolder]: 1159/1795 cut-off events. [2022-12-13 21:53:17,464 INFO L131 PetriNetUnfolder]: For 1957/1957 co-relation queries the response was YES. [2022-12-13 21:53:17,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 1795 events. 1159/1795 cut-off events. For 1957/1957 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8492 event pairs, 195 based on Foata normal form. 0/1790 useless extension candidates. Maximal degree in co-relation 5388. Up to 773 conditions per place. [2022-12-13 21:53:17,471 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 100 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2022-12-13 21:53:17,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 820 flow [2022-12-13 21:53:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:53:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 21:53:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1112 transitions. [2022-12-13 21:53:17,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47440273037542663 [2022-12-13 21:53:17,475 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1112 transitions. [2022-12-13 21:53:17,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1112 transitions. [2022-12-13 21:53:17,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:17,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1112 transitions. [2022-12-13 21:53:17,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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 21:53:17,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 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 21:53:17,479 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 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 21:53:17,480 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 222 flow. Second operand 8 states and 1112 transitions. [2022-12-13 21:53:17,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 820 flow [2022-12-13 21:53:17,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 111 transitions, 554 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-12-13 21:53:17,491 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 156 flow [2022-12-13 21:53:17,491 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-13 21:53:17,492 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2022-12-13 21:53:17,492 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 156 flow [2022-12-13 21:53:17,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 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 21:53:17,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:17,492 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:17,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:17,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:17,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -81302934, now seen corresponding path program 2 times [2022-12-13 21:53:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:17,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942683812] [2022-12-13 21:53:17,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 21:53:17,699 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 21:53:17,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:17,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:17,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:17,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:53:17,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:53:17,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 21:53:17,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:17,835 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 21:53:17,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:17,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942683812] [2022-12-13 21:53:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942683812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:17,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:53:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184025503] [2022-12-13 21:53:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:53:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:17,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:53:17,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:53:17,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 293 [2022-12-13 21:53:17,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 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 21:53:17,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:17,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 293 [2022-12-13 21:53:17,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:18,230 INFO L130 PetriNetUnfolder]: 2053/3185 cut-off events. [2022-12-13 21:53:18,231 INFO L131 PetriNetUnfolder]: For 1415/1415 co-relation queries the response was YES. [2022-12-13 21:53:18,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8076 conditions, 3185 events. 2053/3185 cut-off events. For 1415/1415 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17368 event pairs, 853 based on Foata normal form. 1/3165 useless extension candidates. Maximal degree in co-relation 8069. Up to 1796 conditions per place. [2022-12-13 21:53:18,239 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 73 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2022-12-13 21:53:18,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 437 flow [2022-12-13 21:53:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:53:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:53:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2022-12-13 21:53:18,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4948805460750853 [2022-12-13 21:53:18,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2022-12-13 21:53:18,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2022-12-13 21:53:18,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:18,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2022-12-13 21:53:18,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 21:53:18,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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 21:53:18,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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 21:53:18,244 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 156 flow. Second operand 4 states and 580 transitions. [2022-12-13 21:53:18,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 437 flow [2022-12-13 21:53:18,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:53:18,245 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 184 flow [2022-12-13 21:53:18,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 21:53:18,246 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2022-12-13 21:53:18,246 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 184 flow [2022-12-13 21:53:18,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 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 21:53:18,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:18,246 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:18,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:18,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:18,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1825757247, now seen corresponding path program 1 times [2022-12-13 21:53:18,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:18,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495587022] [2022-12-13 21:53:18,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:53:18,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 21:53:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:18,455 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:18,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:53:18,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 21:53:18,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:19,149 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 21:53:19,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:19,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495587022] [2022-12-13 21:53:19,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495587022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:19,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:19,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:53:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214475342] [2022-12-13 21:53:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:19,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:53:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:53:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:53:19,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 293 [2022-12-13 21:53:19,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 21:53:19,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:19,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 293 [2022-12-13 21:53:19,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:20,074 INFO L130 PetriNetUnfolder]: 1763/2795 cut-off events. [2022-12-13 21:53:20,074 INFO L131 PetriNetUnfolder]: For 939/939 co-relation queries the response was YES. [2022-12-13 21:53:20,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7140 conditions, 2795 events. 1763/2795 cut-off events. For 939/939 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15469 event pairs, 94 based on Foata normal form. 4/2799 useless extension candidates. Maximal degree in co-relation 7131. Up to 2348 conditions per place. [2022-12-13 21:53:20,081 INFO L137 encePairwiseOnDemand]: 288/293 looper letters, 47 selfloop transitions, 4 changer transitions 19/74 dead transitions. [2022-12-13 21:53:20,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 415 flow [2022-12-13 21:53:20,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:53:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:53:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2022-12-13 21:53:20,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42775881683731515 [2022-12-13 21:53:20,083 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2022-12-13 21:53:20,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2022-12-13 21:53:20,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:20,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2022-12-13 21:53:20,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 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 21:53:20,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 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 21:53:20,085 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 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 21:53:20,085 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 184 flow. Second operand 6 states and 752 transitions. [2022-12-13 21:53:20,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 415 flow [2022-12-13 21:53:20,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:53:20,087 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 148 flow [2022-12-13 21:53:20,088 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2022-12-13 21:53:20,088 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2022-12-13 21:53:20,088 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 148 flow [2022-12-13 21:53:20,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 21:53:20,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:20,088 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:20,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:20,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:20,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash 208642524, now seen corresponding path program 3 times [2022-12-13 21:53:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:20,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52102371] [2022-12-13 21:53:20,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 21:53:20,293 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 21:53:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:20,296 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:20,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:20,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 21:53:20,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:53:20,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:53:20,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:20,527 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 21:53:20,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:20,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:20,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52102371] [2022-12-13 21:53:20,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52102371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:20,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:20,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:53:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719804064] [2022-12-13 21:53:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:20,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:20,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:20,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2022-12-13 21:53:20,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 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 21:53:20,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:20,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2022-12-13 21:53:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:20,879 INFO L130 PetriNetUnfolder]: 1463/2357 cut-off events. [2022-12-13 21:53:20,879 INFO L131 PetriNetUnfolder]: For 733/733 co-relation queries the response was YES. [2022-12-13 21:53:20,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 2357 events. 1463/2357 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12217 event pairs, 293 based on Foata normal form. 1/2358 useless extension candidates. Maximal degree in co-relation 6065. Up to 1300 conditions per place. [2022-12-13 21:53:20,886 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 49 selfloop transitions, 1 changer transitions 32/85 dead transitions. [2022-12-13 21:53:20,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 470 flow [2022-12-13 21:53:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-12-13 21:53:20,888 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489419795221843 [2022-12-13 21:53:20,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-12-13 21:53:20,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-12-13 21:53:20,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:20,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-12-13 21:53:20,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 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 21:53:20,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 21:53:20,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 21:53:20,892 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 148 flow. Second operand 5 states and 717 transitions. [2022-12-13 21:53:20,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 470 flow [2022-12-13 21:53:20,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 437 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-12-13 21:53:20,895 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 138 flow [2022-12-13 21:53:20,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-12-13 21:53:20,896 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2022-12-13 21:53:20,896 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 138 flow [2022-12-13 21:53:20,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 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 21:53:20,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:20,897 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:20,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:21,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:21,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 296613764, now seen corresponding path program 4 times [2022-12-13 21:53:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108374698] [2022-12-13 21:53:21,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 21:53:21,100 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 21:53:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:21,102 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:21,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:21,217 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 21:53:21,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 21:53:21,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 21:53:21,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:53:21,250 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 21:53:21,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:53:21,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 21:53:21,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108374698] [2022-12-13 21:53:21,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108374698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:53:21,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:53:21,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:53:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971473884] [2022-12-13 21:53:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:53:21,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:53:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 21:53:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:53:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:53:21,262 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2022-12-13 21:53:21,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 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 21:53:21,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:53:21,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2022-12-13 21:53:21,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:53:21,576 INFO L130 PetriNetUnfolder]: 1376/2247 cut-off events. [2022-12-13 21:53:21,576 INFO L131 PetriNetUnfolder]: For 766/766 co-relation queries the response was YES. [2022-12-13 21:53:21,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 2247 events. 1376/2247 cut-off events. For 766/766 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11263 event pairs, 481 based on Foata normal form. 1/2233 useless extension candidates. Maximal degree in co-relation 5438. Up to 880 conditions per place. [2022-12-13 21:53:21,580 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 43 selfloop transitions, 1 changer transitions 35/82 dead transitions. [2022-12-13 21:53:21,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 439 flow [2022-12-13 21:53:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:53:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:53:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2022-12-13 21:53:21,582 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48464163822525597 [2022-12-13 21:53:21,582 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2022-12-13 21:53:21,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2022-12-13 21:53:21,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:53:21,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2022-12-13 21:53:21,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 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 21:53:21,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 21:53:21,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 21:53:21,584 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 138 flow. Second operand 5 states and 710 transitions. [2022-12-13 21:53:21,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 439 flow [2022-12-13 21:53:21,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 431 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 21:53:21,586 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 142 flow [2022-12-13 21:53:21,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-12-13 21:53:21,586 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2022-12-13 21:53:21,586 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 142 flow [2022-12-13 21:53:21,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 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 21:53:21,587 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:53:21,587 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:21,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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)] Forceful destruction successful, exit code 0 [2022-12-13 21:53:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:21,788 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 21:53:21,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:53:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2030416546, now seen corresponding path program 5 times [2022-12-13 21:53:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 21:53:21,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450439341] [2022-12-13 21:53:21,790 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 21:53:21,791 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 21:53:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 21:53:21,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:21,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 (13)] Waiting until timeout for monitored process [2022-12-13 21:53:21,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 21:53:21,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 21:53:21,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:53:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:53:22,096 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 21:53:22,096 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:53:22,097 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 21:53:22,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 21:53:22,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 21:53:22,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 21:53:22,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 (13)] Ended with exit code 0 [2022-12-13 21:53:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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 21:53:22,301 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:53:22,316 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:53:22,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:53:22,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:53:22 BasicIcfg [2022-12-13 21:53:22,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:53:22,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:53:22,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:53:22,389 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:53:22,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:53:02" (3/4) ... [2022-12-13 21:53:22,391 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 21:53:22,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:53:22,392 INFO L158 Benchmark]: Toolchain (without parser) took 21377.62ms. Allocated memory was 75.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 52.0MB in the beginning and 648.3MB in the end (delta: -596.2MB). Peak memory consumption was 744.0MB. Max. memory is 16.1GB. [2022-12-13 21:53:22,392 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:53:22,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.99ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 41.8MB in the end (delta: 10.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-12-13 21:53:22,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.35ms. Allocated memory is still 75.5MB. Free memory was 41.8MB in the beginning and 39.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:53:22,392 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 75.5MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:53:22,392 INFO L158 Benchmark]: RCFGBuilder took 570.88ms. Allocated memory is still 75.5MB. Free memory was 36.8MB in the beginning and 34.3MB in the end (delta: 2.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-12-13 21:53:22,393 INFO L158 Benchmark]: TraceAbstraction took 20313.62ms. Allocated memory was 75.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 33.5MB in the beginning and 648.3MB in the end (delta: -614.8MB). Peak memory consumption was 722.6MB. Max. memory is 16.1GB. [2022-12-13 21:53:22,393 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 1.4GB. Free memory is still 648.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:53:22,394 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 56.6MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.99ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 41.8MB in the end (delta: 10.0MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.35ms. Allocated memory is still 75.5MB. Free memory was 41.8MB in the beginning and 39.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 75.5MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.88ms. Allocated memory is still 75.5MB. Free memory was 36.8MB in the beginning and 34.3MB in the end (delta: 2.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20313.62ms. Allocated memory was 75.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 33.5MB in the beginning and 648.3MB in the end (delta: -614.8MB). Peak memory consumption was 722.6MB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 1.4GB. Free memory is still 648.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 160 PlacesBefore, 54 PlacesAfterwards, 149 TransitionsBefore, 42 TransitionsAfterwards, 3884 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 140 TotalNumberOfCompositions, 10868 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4730, independent: 4486, independent conditional: 0, independent unconditional: 4486, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2008, independent: 1962, independent conditional: 0, independent unconditional: 1962, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4730, independent: 2524, independent conditional: 0, independent unconditional: 2524, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 2008, unknown conditional: 0, unknown unconditional: 2008] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1025, ((void *)0), P0, ((void *)0))=-1, t1025={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1026, ((void *)0), P1, ((void *)0))=0, t1025={-6:0}, t1026={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1027, ((void *)0), P2, ((void *)0))=1, t1025={-6:0}, t1026={-10:0}, t1027={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L877] 0 pthread_t t1028; [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1028, ((void *)0), P3, ((void *)0))=2, t1025={-6:0}, t1026={-10:0}, t1027={7:0}, t1028={-2:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L824] 4 z = 1 [L827] 4 a = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={-6:0}, t1026={-10:0}, t1027={7:0}, t1028={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1025={-6:0}, t1026={-10:0}, t1027={7:0}, t1028={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 878]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 16 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: 20.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 642 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2082 IncrementalHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 8 mSDtfsCounter, 2082 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 55, 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.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 19 QuantifiedInterpolants, 2042 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 21:53:22,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c27bbf3-16bc-49f2-8ace-e55e91b8c698/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