./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R --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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- 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-38b53e6 [2022-11-25 15:44:57,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:44:57,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:44:57,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:44:57,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:44:57,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:44:57,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:44:57,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:44:57,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:44:57,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:44:57,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:44:57,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:44:57,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:44:57,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:44:57,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:44:57,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:44:57,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:44:57,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:44:57,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:44:57,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:44:57,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:44:57,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:44:57,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:44:57,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:44:57,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:44:57,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:44:57,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:44:57,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:44:57,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:44:57,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:44:57,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:44:57,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:44:57,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:44:57,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:44:57,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:44:57,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:44:57,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:44:57,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:44:57,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:44:57,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:44:57,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:44:57,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:44:57,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:44:57,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:44:57,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:44:57,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:44:57,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:44:57,661 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:44:57,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:44:57,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:44:57,662 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:44:57,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:44:57,663 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:44:57,664 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:44:57,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:44:57,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:44:57,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:44:57,665 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:44:57,665 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:44:57,665 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:44:57,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:44:57,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:44:57,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:44:57,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:44:57,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:44:57,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:44:57,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:44:57,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:57,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:44:57,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:44:57,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:44:57,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:44:57,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:44:57,669 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:44:57,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:44:57,669 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2022-11-25 15:44:57,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:44:57,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:44:57,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:44:57,961 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:44:57,962 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:44:57,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2022-11-25 15:45:01,151 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:45:01,415 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:45:01,416 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2022-11-25 15:45:01,437 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data/4a5b50f0a/af22947a9a4244b09bab1b17507a1235/FLAG3344ad68a [2022-11-25 15:45:01,461 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data/4a5b50f0a/af22947a9a4244b09bab1b17507a1235 [2022-11-25 15:45:01,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:45:01,469 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:45:01,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:01,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:45:01,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:45:01,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:01" (1/1) ... [2022-11-25 15:45:01,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471bb56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:01, skipping insertion in model container [2022-11-25 15:45:01,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:01" (1/1) ... [2022-11-25 15:45:01,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:45:01,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:45:01,719 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2022-11-25 15:45:01,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:01,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:01,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:02,030 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:45:02,043 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2022-11-25 15:45:02,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:02,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:02,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:02,181 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:45:02,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02 WrapperNode [2022-11-25 15:45:02,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:02,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:02,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:45:02,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:45:02,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,235 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-11-25 15:45:02,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:02,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:45:02,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:45:02,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:45:02,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:45:02,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:45:02,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:45:02,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:45:02,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (1/1) ... [2022-11-25 15:45:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:02,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:45:02,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:45:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:45:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:45:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:45:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:45:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:45:02,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:45:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:45:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:45:02,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:45:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:45:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:45:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:45:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:45:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:45:02,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:45:02,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:45:02,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:45:02,426 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:45:02,699 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:45:02,701 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:45:03,094 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:45:03,307 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:45:03,307 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:45:03,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:03 BoogieIcfgContainer [2022-11-25 15:45:03,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:45:03,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:45:03,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:45:03,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:45:03,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:45:01" (1/3) ... [2022-11-25 15:45:03,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c055815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:03, skipping insertion in model container [2022-11-25 15:45:03,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:02" (2/3) ... [2022-11-25 15:45:03,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c055815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:03, skipping insertion in model container [2022-11-25 15:45:03,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:03" (3/3) ... [2022-11-25 15:45:03,320 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-11-25 15:45:03,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:45:03,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 15:45:03,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:45:03,405 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:45:03,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-25 15:45:03,507 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-25 15:45:03,507 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:03,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-25 15:45:03,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2022-11-25 15:45:03,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2022-11-25 15:45:03,525 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:45:03,558 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2022-11-25 15:45:03,561 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2022-11-25 15:45:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2022-11-25 15:45:03,598 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-25 15:45:03,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:03,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-25 15:45:03,602 INFO L119 LiptonReduction]: Number of co-enabled transitions 3394 [2022-11-25 15:45:11,376 INFO L134 LiptonReduction]: Checked pairs total: 9081 [2022-11-25 15:45:11,377 INFO L136 LiptonReduction]: Total number of compositions: 139 [2022-11-25 15:45:11,405 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:45:11,413 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;@394c30a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:45:11,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 15:45:11,415 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:45:11,415 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:11,415 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:11,417 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:45:11,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash 629, now seen corresponding path program 1 times [2022-11-25 15:45:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956369998] [2022-11-25 15:45:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956369998] [2022-11-25 15:45:11,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956369998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:11,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:11,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:45:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278598734] [2022-11-25 15:45:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:11,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:45:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:45:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:45:11,628 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 289 [2022-11-25 15:45:11,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 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-11-25 15:45:11,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:11,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 289 [2022-11-25 15:45:11,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:12,695 INFO L130 PetriNetUnfolder]: 4373/6062 cut-off events. [2022-11-25 15:45:12,696 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 15:45:12,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12148 conditions, 6062 events. 4373/6062 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 31809 event pairs, 4373 based on Foata normal form. 0/5335 useless extension candidates. Maximal degree in co-relation 12136. Up to 5983 conditions per place. [2022-11-25 15:45:12,746 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-25 15:45:12,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-11-25 15:45:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:45:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:45:12,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2022-11-25 15:45:12,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5346020761245674 [2022-11-25 15:45:12,769 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2022-11-25 15:45:12,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2022-11-25 15:45:12,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:12,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2022-11-25 15:45:12,783 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-11-25 15:45:12,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,791 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,793 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2022-11-25 15:45:12,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-11-25 15:45:12,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:12,803 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-25 15:45:12,806 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-25 15:45:12,810 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-25 15:45:12,810 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-25 15:45:12,811 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-11-25 15:45:12,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:12,811 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:12,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:45:12,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash 525438052, now seen corresponding path program 1 times [2022-11-25 15:45:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49674634] [2022-11-25 15:45:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:13,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49674634] [2022-11-25 15:45:13,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49674634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:13,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:13,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650565608] [2022-11-25 15:45:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:13,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:13,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:13,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 289 [2022-11-25 15:45:13,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 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-11-25 15:45:13,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:13,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 289 [2022-11-25 15:45:13,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:14,173 INFO L130 PetriNetUnfolder]: 3632/5249 cut-off events. [2022-11-25 15:45:14,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:14,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10339 conditions, 5249 events. 3632/5249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29756 event pairs, 668 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 10336. Up to 3973 conditions per place. [2022-11-25 15:45:14,204 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-25 15:45:14,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2022-11-25 15:45:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-11-25 15:45:14,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5155709342560554 [2022-11-25 15:45:14,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-11-25 15:45:14,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-11-25 15:45:14,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:14,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-11-25 15:45:14,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:14,216 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2022-11-25 15:45:14,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2022-11-25 15:45:14,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:45:14,218 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-25 15:45:14,219 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-25 15:45:14,222 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-25 15:45:14,225 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-25 15:45:14,226 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-11-25 15:45:14,226 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:14,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:14,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:45:14,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:14,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:14,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1828667036, now seen corresponding path program 1 times [2022-11-25 15:45:14,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:14,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115932996] [2022-11-25 15:45:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115932996] [2022-11-25 15:45:15,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115932996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:15,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:15,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642544107] [2022-11-25 15:45:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:15,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:15,576 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 289 [2022-11-25 15:45:15,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:15,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:15,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 289 [2022-11-25 15:45:15,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:16,256 INFO L130 PetriNetUnfolder]: 2594/3778 cut-off events. [2022-11-25 15:45:16,257 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-11-25 15:45:16,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7652 conditions, 3778 events. 2594/3778 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20008 event pairs, 156 based on Foata normal form. 0/3775 useless extension candidates. Maximal degree in co-relation 7648. Up to 2097 conditions per place. [2022-11-25 15:45:16,280 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 42 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2022-11-25 15:45:16,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 208 flow [2022-11-25 15:45:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2022-11-25 15:45:16,284 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43944636678200694 [2022-11-25 15:45:16,284 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2022-11-25 15:45:16,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2022-11-25 15:45:16,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:16,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2022-11-25 15:45:16,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,293 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,293 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 889 transitions. [2022-11-25 15:45:16,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 208 flow [2022-11-25 15:45:16,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:16,298 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 72 flow [2022-11-25 15:45:16,298 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-11-25 15:45:16,299 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-11-25 15:45:16,299 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 72 flow [2022-11-25 15:45:16,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,300 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:16,300 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:16,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:45:16,301 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1828667062, now seen corresponding path program 1 times [2022-11-25 15:45:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:16,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984448363] [2022-11-25 15:45:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:16,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:16,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984448363] [2022-11-25 15:45:16,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984448363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:16,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:16,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107540508] [2022-11-25 15:45:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:16,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:16,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:16,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 289 [2022-11-25 15:45:16,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:16,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:16,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 289 [2022-11-25 15:45:16,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:18,050 INFO L130 PetriNetUnfolder]: 8389/11446 cut-off events. [2022-11-25 15:45:18,050 INFO L131 PetriNetUnfolder]: For 553/553 co-relation queries the response was YES. [2022-11-25 15:45:18,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23675 conditions, 11446 events. 8389/11446 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 53894 event pairs, 3793 based on Foata normal form. 480/11926 useless extension candidates. Maximal degree in co-relation 23671. Up to 9735 conditions per place. [2022-11-25 15:45:18,112 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 38 selfloop transitions, 5 changer transitions 24/67 dead transitions. [2022-11-25 15:45:18,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 304 flow [2022-11-25 15:45:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2022-11-25 15:45:18,115 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4802768166089965 [2022-11-25 15:45:18,116 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2022-11-25 15:45:18,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2022-11-25 15:45:18,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:18,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2022-11-25 15:45:18,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:18,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:18,123 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:18,123 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 72 flow. Second operand 5 states and 694 transitions. [2022-11-25 15:45:18,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 304 flow [2022-11-25 15:45:18,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 15:45:18,126 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 109 flow [2022-11-25 15:45:18,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-11-25 15:45:18,127 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-11-25 15:45:18,128 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 109 flow [2022-11-25 15:45:18,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:18,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:18,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:18,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:45:18,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1210921750, now seen corresponding path program 1 times [2022-11-25 15:45:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:18,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595664124] [2022-11-25 15:45:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595664124] [2022-11-25 15:45:18,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595664124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:18,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:18,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061644978] [2022-11-25 15:45:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:18,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:18,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:18,380 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 289 [2022-11-25 15:45:18,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:18,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:18,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 289 [2022-11-25 15:45:18,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:19,893 INFO L130 PetriNetUnfolder]: 7285/9950 cut-off events. [2022-11-25 15:45:19,894 INFO L131 PetriNetUnfolder]: For 5410/5410 co-relation queries the response was YES. [2022-11-25 15:45:19,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25778 conditions, 9950 events. 7285/9950 cut-off events. For 5410/5410 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 46105 event pairs, 2539 based on Foata normal form. 440/10390 useless extension candidates. Maximal degree in co-relation 25771. Up to 6163 conditions per place. [2022-11-25 15:45:19,960 INFO L137 encePairwiseOnDemand]: 285/289 looper letters, 45 selfloop transitions, 3 changer transitions 27/75 dead transitions. [2022-11-25 15:45:19,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 396 flow [2022-11-25 15:45:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2022-11-25 15:45:19,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48304498269896196 [2022-11-25 15:45:19,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2022-11-25 15:45:19,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2022-11-25 15:45:19,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:19,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2022-11-25 15:45:19,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:19,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:19,969 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:19,970 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 109 flow. Second operand 5 states and 698 transitions. [2022-11-25 15:45:19,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 396 flow [2022-11-25 15:45:20,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:20,015 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 117 flow [2022-11-25 15:45:20,016 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2022-11-25 15:45:20,016 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-11-25 15:45:20,017 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 117 flow [2022-11-25 15:45:20,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,017 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:20,017 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:20,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:45:20,018 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1178761470, now seen corresponding path program 1 times [2022-11-25 15:45:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845405205] [2022-11-25 15:45:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:20,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:20,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845405205] [2022-11-25 15:45:20,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845405205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:20,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:20,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376382905] [2022-11-25 15:45:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:20,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:20,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 289 [2022-11-25 15:45:20,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:20,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 289 [2022-11-25 15:45:20,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:21,362 INFO L130 PetriNetUnfolder]: 6261/8582 cut-off events. [2022-11-25 15:45:21,363 INFO L131 PetriNetUnfolder]: For 6865/6865 co-relation queries the response was YES. [2022-11-25 15:45:21,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22879 conditions, 8582 events. 6261/8582 cut-off events. For 6865/6865 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 37891 event pairs, 1743 based on Foata normal form. 288/8870 useless extension candidates. Maximal degree in co-relation 22870. Up to 5313 conditions per place. [2022-11-25 15:45:21,410 INFO L137 encePairwiseOnDemand]: 285/289 looper letters, 40 selfloop transitions, 3 changer transitions 22/65 dead transitions. [2022-11-25 15:45:21,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 355 flow [2022-11-25 15:45:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2022-11-25 15:45:21,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47612456747404847 [2022-11-25 15:45:21,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2022-11-25 15:45:21,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2022-11-25 15:45:21,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:21,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2022-11-25 15:45:21,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:21,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:21,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:21,419 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 117 flow. Second operand 5 states and 688 transitions. [2022-11-25 15:45:21,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 355 flow [2022-11-25 15:45:21,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 343 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:21,444 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 122 flow [2022-11-25 15:45:21,444 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2022-11-25 15:45:21,445 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-11-25 15:45:21,445 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 122 flow [2022-11-25 15:45:21,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:21,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:21,446 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:21,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:45:21,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1292840437, now seen corresponding path program 1 times [2022-11-25 15:45:21,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:21,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4243055] [2022-11-25 15:45:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:21,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4243055] [2022-11-25 15:45:21,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4243055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:21,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:21,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262007225] [2022-11-25 15:45:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:21,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:21,734 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 289 [2022-11-25 15:45:21,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:21,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:21,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 289 [2022-11-25 15:45:21,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:22,345 INFO L130 PetriNetUnfolder]: 2694/4047 cut-off events. [2022-11-25 15:45:22,346 INFO L131 PetriNetUnfolder]: For 2596/2740 co-relation queries the response was YES. [2022-11-25 15:45:22,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10492 conditions, 4047 events. 2694/4047 cut-off events. For 2596/2740 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22008 event pairs, 441 based on Foata normal form. 289/4231 useless extension candidates. Maximal degree in co-relation 10482. Up to 1863 conditions per place. [2022-11-25 15:45:22,373 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 48 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2022-11-25 15:45:22,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 318 flow [2022-11-25 15:45:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:45:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:45:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-11-25 15:45:22,376 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49653979238754326 [2022-11-25 15:45:22,376 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2022-11-25 15:45:22,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2022-11-25 15:45:22,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:22,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2022-11-25 15:45:22,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,381 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 289.0) internal successors, (1445), 5 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,381 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 122 flow. Second operand 4 states and 574 transitions. [2022-11-25 15:45:22,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 318 flow [2022-11-25 15:45:22,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 304 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:22,390 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 158 flow [2022-11-25 15:45:22,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-11-25 15:45:22,391 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-11-25 15:45:22,391 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 158 flow [2022-11-25 15:45:22,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:22,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:22,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:45:22,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1262296301, now seen corresponding path program 1 times [2022-11-25 15:45:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:22,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696766983] [2022-11-25 15:45:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696766983] [2022-11-25 15:45:22,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696766983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:22,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:22,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871097338] [2022-11-25 15:45:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:22,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:22,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:22,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 289 [2022-11-25 15:45:22,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 158 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-11-25 15:45:22,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:22,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 289 [2022-11-25 15:45:22,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:23,567 INFO L130 PetriNetUnfolder]: 2156/3382 cut-off events. [2022-11-25 15:45:23,567 INFO L131 PetriNetUnfolder]: For 2607/2851 co-relation queries the response was YES. [2022-11-25 15:45:23,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10458 conditions, 3382 events. 2156/3382 cut-off events. For 2607/2851 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18828 event pairs, 414 based on Foata normal form. 230/3515 useless extension candidates. Maximal degree in co-relation 10448. Up to 1179 conditions per place. [2022-11-25 15:45:23,592 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 60 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2022-11-25 15:45:23,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 437 flow [2022-11-25 15:45:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2022-11-25 15:45:23,596 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4982698961937716 [2022-11-25 15:45:23,596 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2022-11-25 15:45:23,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2022-11-25 15:45:23,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:23,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2022-11-25 15:45:23,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.0) internal successors, (720), 5 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-11-25 15:45:23,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,603 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 158 flow. Second operand 5 states and 720 transitions. [2022-11-25 15:45:23,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 437 flow [2022-11-25 15:45:23,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 434 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:23,607 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 223 flow [2022-11-25 15:45:23,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-25 15:45:23,610 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-11-25 15:45:23,610 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 223 flow [2022-11-25 15:45:23,611 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-11-25 15:45:23,611 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:23,611 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] [2022-11-25 15:45:23,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:45:23,611 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash -38362563, now seen corresponding path program 1 times [2022-11-25 15:45:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:23,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276221641] [2022-11-25 15:45:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276221641] [2022-11-25 15:45:23,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276221641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:23,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:23,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142179747] [2022-11-25 15:45:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:23,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:23,927 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 289 [2022-11-25 15:45:23,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:23,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 289 [2022-11-25 15:45:23,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:25,258 INFO L130 PetriNetUnfolder]: 5435/8028 cut-off events. [2022-11-25 15:45:25,258 INFO L131 PetriNetUnfolder]: For 15282/15282 co-relation queries the response was YES. [2022-11-25 15:45:25,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29087 conditions, 8028 events. 5435/8028 cut-off events. For 15282/15282 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43417 event pairs, 653 based on Foata normal form. 39/8067 useless extension candidates. Maximal degree in co-relation 29075. Up to 4511 conditions per place. [2022-11-25 15:45:25,293 INFO L137 encePairwiseOnDemand]: 281/289 looper letters, 81 selfloop transitions, 10 changer transitions 36/127 dead transitions. [2022-11-25 15:45:25,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 893 flow [2022-11-25 15:45:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions. [2022-11-25 15:45:25,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4750370736529906 [2022-11-25 15:45:25,296 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 961 transitions. [2022-11-25 15:45:25,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions. [2022-11-25 15:45:25,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:25,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions. [2022-11-25 15:45:25,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,304 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,304 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 223 flow. Second operand 7 states and 961 transitions. [2022-11-25 15:45:25,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 893 flow [2022-11-25 15:45:25,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 855 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:25,318 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 248 flow [2022-11-25 15:45:25,318 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2022-11-25 15:45:25,319 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2022-11-25 15:45:25,319 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 248 flow [2022-11-25 15:45:25,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:25,320 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] [2022-11-25 15:45:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:45:25,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:25,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1580592081, now seen corresponding path program 2 times [2022-11-25 15:45:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:25,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464522311] [2022-11-25 15:45:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:25,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464522311] [2022-11-25 15:45:25,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464522311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:25,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:25,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37161987] [2022-11-25 15:45:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:25,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:25,552 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 289 [2022-11-25 15:45:25,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 248 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-11-25 15:45:25,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:25,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 289 [2022-11-25 15:45:25,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:26,005 INFO L130 PetriNetUnfolder]: 1247/2045 cut-off events. [2022-11-25 15:45:26,005 INFO L131 PetriNetUnfolder]: For 3618/3863 co-relation queries the response was YES. [2022-11-25 15:45:26,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7420 conditions, 2045 events. 1247/2045 cut-off events. For 3618/3863 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10831 event pairs, 199 based on Foata normal form. 163/2138 useless extension candidates. Maximal degree in co-relation 7405. Up to 634 conditions per place. [2022-11-25 15:45:26,019 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 71 selfloop transitions, 14 changer transitions 0/92 dead transitions. [2022-11-25 15:45:26,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 616 flow [2022-11-25 15:45:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:45:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2022-11-25 15:45:26,023 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.497116493656286 [2022-11-25 15:45:26,023 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 862 transitions. [2022-11-25 15:45:26,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 862 transitions. [2022-11-25 15:45:26,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:26,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 862 transitions. [2022-11-25 15:45:26,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,030 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,030 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 248 flow. Second operand 6 states and 862 transitions. [2022-11-25 15:45:26,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 616 flow [2022-11-25 15:45:26,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 585 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 15:45:26,061 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 302 flow [2022-11-25 15:45:26,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2022-11-25 15:45:26,062 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2022-11-25 15:45:26,062 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 302 flow [2022-11-25 15:45:26,063 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-11-25 15:45:26,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:26,063 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-11-25 15:45:26,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:45:26,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash -340893599, now seen corresponding path program 1 times [2022-11-25 15:45:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:26,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094556853] [2022-11-25 15:45:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:26,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094556853] [2022-11-25 15:45:26,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094556853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:26,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:26,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176923528] [2022-11-25 15:45:26,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:26,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:26,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:26,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 289 [2022-11-25 15:45:26,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:26,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 289 [2022-11-25 15:45:26,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:27,010 INFO L130 PetriNetUnfolder]: 2182/3523 cut-off events. [2022-11-25 15:45:27,010 INFO L131 PetriNetUnfolder]: For 7538/7702 co-relation queries the response was YES. [2022-11-25 15:45:27,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13730 conditions, 3523 events. 2182/3523 cut-off events. For 7538/7702 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 19990 event pairs, 375 based on Foata normal form. 17/3458 useless extension candidates. Maximal degree in co-relation 13715. Up to 1857 conditions per place. [2022-11-25 15:45:27,031 INFO L137 encePairwiseOnDemand]: 285/289 looper letters, 66 selfloop transitions, 2 changer transitions 34/108 dead transitions. [2022-11-25 15:45:27,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 904 flow [2022-11-25 15:45:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-11-25 15:45:27,034 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4961937716262976 [2022-11-25 15:45:27,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-11-25 15:45:27,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-11-25 15:45:27,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:27,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-11-25 15:45:27,037 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-11-25 15:45:27,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,041 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,041 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 302 flow. Second operand 5 states and 717 transitions. [2022-11-25 15:45:27,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 904 flow [2022-11-25 15:45:27,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 108 transitions, 822 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-11-25 15:45:27,085 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 280 flow [2022-11-25 15:45:27,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2022-11-25 15:45:27,086 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2022-11-25 15:45:27,086 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 280 flow [2022-11-25 15:45:27,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,086 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:27,087 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-11-25 15:45:27,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:45:27,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash -543460787, now seen corresponding path program 2 times [2022-11-25 15:45:27,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:27,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720583680] [2022-11-25 15:45:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:27,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:27,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720583680] [2022-11-25 15:45:27,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720583680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:27,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:27,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:45:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282303052] [2022-11-25 15:45:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:27,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:27,406 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 289 [2022-11-25 15:45:27,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 280 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-11-25 15:45:27,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:27,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 289 [2022-11-25 15:45:27,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:27,939 INFO L130 PetriNetUnfolder]: 1762/2865 cut-off events. [2022-11-25 15:45:27,940 INFO L131 PetriNetUnfolder]: For 4352/4673 co-relation queries the response was YES. [2022-11-25 15:45:27,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10585 conditions, 2865 events. 1762/2865 cut-off events. For 4352/4673 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16441 event pairs, 249 based on Foata normal form. 101/2832 useless extension candidates. Maximal degree in co-relation 10567. Up to 988 conditions per place. [2022-11-25 15:45:27,949 INFO L137 encePairwiseOnDemand]: 282/289 looper letters, 48 selfloop transitions, 18 changer transitions 11/82 dead transitions. [2022-11-25 15:45:27,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 559 flow [2022-11-25 15:45:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2022-11-25 15:45:27,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4854176964903609 [2022-11-25 15:45:27,955 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2022-11-25 15:45:27,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2022-11-25 15:45:27,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:27,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2022-11-25 15:45:27,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,973 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 289.0) internal successors, (2312), 8 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,974 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 280 flow. Second operand 7 states and 982 transitions. [2022-11-25 15:45:27,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 559 flow [2022-11-25 15:45:28,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 535 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:28,017 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 272 flow [2022-11-25 15:45:28,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2022-11-25 15:45:28,018 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2022-11-25 15:45:28,018 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 272 flow [2022-11-25 15:45:28,019 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-11-25 15:45:28,019 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:28,019 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] [2022-11-25 15:45:28,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:45:28,019 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:28,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1680320303, now seen corresponding path program 1 times [2022-11-25 15:45:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:28,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114198163] [2022-11-25 15:45:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:28,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-11-25 15:45:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:28,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114198163] [2022-11-25 15:45:28,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114198163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:28,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:28,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652293397] [2022-11-25 15:45:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:28,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:28,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 289 [2022-11-25 15:45:28,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:28,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 289 [2022-11-25 15:45:28,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:28,628 INFO L130 PetriNetUnfolder]: 927/1609 cut-off events. [2022-11-25 15:45:28,629 INFO L131 PetriNetUnfolder]: For 3651/3669 co-relation queries the response was YES. [2022-11-25 15:45:28,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6287 conditions, 1609 events. 927/1609 cut-off events. For 3651/3669 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8336 event pairs, 263 based on Foata normal form. 1/1587 useless extension candidates. Maximal degree in co-relation 6270. Up to 907 conditions per place. [2022-11-25 15:45:28,635 INFO L137 encePairwiseOnDemand]: 285/289 looper letters, 37 selfloop transitions, 1 changer transitions 45/86 dead transitions. [2022-11-25 15:45:28,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 756 flow [2022-11-25 15:45:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2022-11-25 15:45:28,638 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4892733564013841 [2022-11-25 15:45:28,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2022-11-25 15:45:28,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2022-11-25 15:45:28,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:28,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2022-11-25 15:45:28,641 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-11-25 15:45:28,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,644 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,645 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 272 flow. Second operand 5 states and 707 transitions. [2022-11-25 15:45:28,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 756 flow [2022-11-25 15:45:28,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 477 flow, removed 46 selfloop flow, removed 16 redundant places. [2022-11-25 15:45:28,672 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 149 flow [2022-11-25 15:45:28,673 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=149, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2022-11-25 15:45:28,674 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2022-11-25 15:45:28,674 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 149 flow [2022-11-25 15:45:28,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,675 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:28,675 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] [2022-11-25 15:45:28,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:45:28,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1337416371, now seen corresponding path program 2 times [2022-11-25 15:45:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:28,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644501642] [2022-11-25 15:45:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:30,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644501642] [2022-11-25 15:45:30,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644501642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:30,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:30,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:45:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421180365] [2022-11-25 15:45:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:30,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:45:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:45:30,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:45:30,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 289 [2022-11-25 15:45:30,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 149 flow. Second operand has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:30,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:30,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 289 [2022-11-25 15:45:30,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:31,286 INFO L130 PetriNetUnfolder]: 417/770 cut-off events. [2022-11-25 15:45:31,286 INFO L131 PetriNetUnfolder]: For 724/729 co-relation queries the response was YES. [2022-11-25 15:45:31,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 770 events. 417/770 cut-off events. For 724/729 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3704 event pairs, 83 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 2218. Up to 309 conditions per place. [2022-11-25 15:45:31,288 INFO L137 encePairwiseOnDemand]: 281/289 looper letters, 39 selfloop transitions, 5 changer transitions 29/77 dead transitions. [2022-11-25 15:45:31,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 449 flow [2022-11-25 15:45:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:45:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:45:31,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions. [2022-11-25 15:45:31,292 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44944252210688196 [2022-11-25 15:45:31,293 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions. [2022-11-25 15:45:31,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions. [2022-11-25 15:45:31,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:31,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions. [2022-11-25 15:45:31,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,302 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 289.0) internal successors, (2890), 10 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,302 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 149 flow. Second operand 9 states and 1169 transitions. [2022-11-25 15:45:31,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 449 flow [2022-11-25 15:45:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 436 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:31,306 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 160 flow [2022-11-25 15:45:31,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=160, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2022-11-25 15:45:31,307 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2022-11-25 15:45:31,307 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 160 flow [2022-11-25 15:45:31,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:31,308 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] [2022-11-25 15:45:31,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:45:31,308 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1172927503, now seen corresponding path program 3 times [2022-11-25 15:45:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:31,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281731182] [2022-11-25 15:45:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:31,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:45:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:31,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:45:31,460 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:45:31,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 15:45:31,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 15:45:31,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 15:45:31,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 15:45:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 15:45:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 15:45:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 15:45:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 15:45:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 15:45:31,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 15:45:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 15:45:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 15:45:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 15:45:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 15:45:31,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 15:45:31,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 15:45:31,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:45:31,466 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:31,473 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:45:31,474 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:45:31,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:45:31 BasicIcfg [2022-11-25 15:45:31,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:45:31,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:45:31,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:45:31,602 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:45:31,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:03" (3/4) ... [2022-11-25 15:45:31,605 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:45:31,605 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:45:31,606 INFO L158 Benchmark]: Toolchain (without parser) took 30137.04ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 126.6MB in the beginning and 683.2MB in the end (delta: -556.5MB). Peak memory consumption was 549.7MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,606 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 83.6MB in the end (delta: 136.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.62ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 97.3MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.40ms. Allocated memory is still 174.1MB. Free memory was 97.3MB in the beginning and 94.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,608 INFO L158 Benchmark]: Boogie Preprocessor took 63.75ms. Allocated memory is still 174.1MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,608 INFO L158 Benchmark]: RCFGBuilder took 1009.47ms. Allocated memory is still 174.1MB. Free memory was 92.5MB in the beginning and 112.4MB in the end (delta: -19.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,608 INFO L158 Benchmark]: TraceAbstraction took 28288.66ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 111.4MB in the beginning and 683.2MB in the end (delta: -571.8MB). Peak memory consumption was 531.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:31,611 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 1.3GB. Free memory is still 683.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:31,612 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.30ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 83.6MB in the end (delta: 136.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.62ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 97.3MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.40ms. Allocated memory is still 174.1MB. Free memory was 97.3MB in the beginning and 94.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.75ms. Allocated memory is still 174.1MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1009.47ms. Allocated memory is still 174.1MB. Free memory was 92.5MB in the beginning and 112.4MB in the end (delta: -19.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28288.66ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 111.4MB in the beginning and 683.2MB in the end (delta: -571.8MB). Peak memory consumption was 531.3MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 1.3GB. Free memory is still 683.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 157 PlacesBefore, 51 PlacesAfterwards, 146 TransitionsBefore, 39 TransitionsAfterwards, 3394 CoEnabledTransitionPairs, 8 FixpointIterations, 53 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 139 TotalNumberOfCompositions, 9081 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5533, independent: 5314, independent conditional: 0, independent unconditional: 5314, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2500, independent: 2433, independent conditional: 0, independent unconditional: 2433, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2500, independent: 2408, independent conditional: 0, independent unconditional: 2408, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 674, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5533, independent: 2881, independent conditional: 0, independent unconditional: 2881, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 2500, unknown conditional: 0, unknown unconditional: 2500] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 324, Positive conditional cache size: 0, Positive unconditional cache size: 324, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=-3, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=-2, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=-1, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 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_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 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_p1_EAX=1, __unbuffered_p1_EBX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 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: 28.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1073 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 888 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2288 IncrementalHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 82 mSDtfsCounter, 2288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=10, InterpolantAutomatonStates: 75, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 2664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:45:31,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R --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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- 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-38b53e6 [2022-11-25 15:45:34,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:45:34,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:45:34,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:45:34,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:45:34,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:45:34,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:45:34,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:45:34,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:45:34,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:45:34,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:45:34,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:45:34,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:45:34,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:45:34,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:45:34,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:45:34,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:45:34,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:45:34,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:45:34,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:45:34,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:45:34,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:45:34,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:45:34,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:45:34,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:45:34,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:45:34,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:45:34,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:45:34,167 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:45:34,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:45:34,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:45:34,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:45:34,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:45:34,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:45:34,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:45:34,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:45:34,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:45:34,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:45:34,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:45:34,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:45:34,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:45:34,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:45:34,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:45:34,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:45:34,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:45:34,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:45:34,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:45:34,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:45:34,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:45:34,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:45:34,224 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:45:34,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:45:34,226 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:45:34,226 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:45:34,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:45:34,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:45:34,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:45:34,227 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:45:34,227 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:45:34,227 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:45:34,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:45:34,228 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:45:34,228 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:45:34,228 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:45:34,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:45:34,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:45:34,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:45:34,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:45:34,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:45:34,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:34,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:45:34,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:45:34,230 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:45:34,230 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:45:34,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:45:34,231 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:45:34,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:45:34,232 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:45:34,232 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2022-11-25 15:45:34,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:45:34,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:45:34,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:45:34,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:45:34,647 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:45:34,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2022-11-25 15:45:37,829 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:45:38,218 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:45:38,219 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2022-11-25 15:45:38,232 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data/911a2e970/80c5e543431a44bea4ec7a9b2c56b769/FLAGd8be48d4b [2022-11-25 15:45:38,250 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/data/911a2e970/80c5e543431a44bea4ec7a9b2c56b769 [2022-11-25 15:45:38,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:45:38,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:45:38,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:38,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:45:38,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:45:38,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:38" (1/1) ... [2022-11-25 15:45:38,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d72a7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:38, skipping insertion in model container [2022-11-25 15:45:38,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:38" (1/1) ... [2022-11-25 15:45:38,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:45:38,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:45:38,492 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2022-11-25 15:45:38,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:38,891 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:45:38,908 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_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2022-11-25 15:45:38,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:38,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:38,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:39,051 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:45:39,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39 WrapperNode [2022-11-25 15:45:39,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:39,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:39,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:45:39,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:45:39,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,163 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-25 15:45:39,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:39,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:45:39,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:45:39,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:45:39,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:45:39,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:45:39,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:45:39,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:45:39,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (1/1) ... [2022-11-25 15:45:39,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:39,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:45:39,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:45:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:45:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:45:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:45:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:45:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:45:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:45:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:45:39,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:45:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:45:39,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:45:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:45:39,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:45:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:45:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:45:39,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:45:39,351 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:45:39,606 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:45:39,616 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:45:40,172 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:45:40,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:45:40,355 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:45:40,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:40 BoogieIcfgContainer [2022-11-25 15:45:40,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:45:40,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:45:40,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:45:40,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:45:40,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:45:38" (1/3) ... [2022-11-25 15:45:40,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707b747b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:40, skipping insertion in model container [2022-11-25 15:45:40,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:39" (2/3) ... [2022-11-25 15:45:40,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707b747b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:40, skipping insertion in model container [2022-11-25 15:45:40,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:40" (3/3) ... [2022-11-25 15:45:40,386 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-11-25 15:45:40,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:45:40,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 15:45:40,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:45:40,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:45:40,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 15:45:40,645 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 15:45:40,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:40,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-25 15:45:40,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-11-25 15:45:40,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-11-25 15:45:40,661 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:45:40,677 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 15:45:40,680 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-11-25 15:45:40,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-11-25 15:45:40,729 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-25 15:45:40,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:40,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-25 15:45:40,733 INFO L119 LiptonReduction]: Number of co-enabled transitions 3394 [2022-11-25 15:45:51,714 INFO L134 LiptonReduction]: Checked pairs total: 8545 [2022-11-25 15:45:51,715 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-25 15:45:51,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:45:51,738 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;@180eb844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:45:51,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 15:45:51,740 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:45:51,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:51,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:51,741 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:45:51,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 635, now seen corresponding path program 1 times [2022-11-25 15:45:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:51,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125213896] [2022-11-25 15:45:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:51,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:51,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:51,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 15:45:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:51,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:45:51,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:51,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:51,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:45:51,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125213896] [2022-11-25 15:45:51,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125213896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:51,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:51,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:45:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179395569] [2022-11-25 15:45:51,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:51,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:45:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:45:51,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:45:51,918 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 296 [2022-11-25 15:45:51,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 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-11-25 15:45:51,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:51,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 296 [2022-11-25 15:45:51,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:53,211 INFO L130 PetriNetUnfolder]: 4373/6062 cut-off events. [2022-11-25 15:45:53,212 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 15:45:53,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12148 conditions, 6062 events. 4373/6062 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 31683 event pairs, 4373 based on Foata normal form. 0/5335 useless extension candidates. Maximal degree in co-relation 12136. Up to 5983 conditions per place. [2022-11-25 15:45:53,267 INFO L137 encePairwiseOnDemand]: 287/296 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-25 15:45:53,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-11-25 15:45:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:45:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:45:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 311 transitions. [2022-11-25 15:45:53,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5253378378378378 [2022-11-25 15:45:53,290 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 311 transitions. [2022-11-25 15:45:53,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 311 transitions. [2022-11-25 15:45:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:53,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 311 transitions. [2022-11-25 15:45:53,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:53,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:53,305 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:53,307 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 311 transitions. [2022-11-25 15:45:53,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-11-25 15:45:53,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:53,314 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-25 15:45:53,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-25 15:45:53,319 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-25 15:45:53,320 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-25 15:45:53,320 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-11-25 15:45:53,320 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:53,321 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:53,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:53,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:53,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1364685017, now seen corresponding path program 1 times [2022-11-25 15:45:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:53,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720320042] [2022-11-25 15:45:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:53,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:53,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 15:45:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:53,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:45:53,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:53,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:53,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:45:53,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720320042] [2022-11-25 15:45:53,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720320042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:53,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:53,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:53,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345678902] [2022-11-25 15:45:53,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:53,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:53,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:53,750 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 296 [2022-11-25 15:45:53,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:53,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:53,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 296 [2022-11-25 15:45:53,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:54,681 INFO L130 PetriNetUnfolder]: 3632/5249 cut-off events. [2022-11-25 15:45:54,681 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:54,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10339 conditions, 5249 events. 3632/5249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 29756 event pairs, 668 based on Foata normal form. 0/4882 useless extension candidates. Maximal degree in co-relation 10336. Up to 3973 conditions per place. [2022-11-25 15:45:54,712 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2022-11-25 15:45:54,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2022-11-25 15:45:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2022-11-25 15:45:54,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2022-11-25 15:45:54,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2022-11-25 15:45:54,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2022-11-25 15:45:54,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:54,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2022-11-25 15:45:54,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:54,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:54,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:54,736 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 450 transitions. [2022-11-25 15:45:54,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2022-11-25 15:45:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:45:54,738 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-25 15:45:54,738 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-25 15:45:54,739 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-25 15:45:54,739 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-25 15:45:54,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:54,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:54,740 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:54,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:54,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:54,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash 831200390, now seen corresponding path program 1 times [2022-11-25 15:45:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:54,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720814410] [2022-11-25 15:45:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:54,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:54,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:54,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:54,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 15:45:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:55,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:45:55,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:55,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:55,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:45:55,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720814410] [2022-11-25 15:45:55,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720814410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:55,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:55,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526760148] [2022-11-25 15:45:55,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:55,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:55,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:55,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 15:45:55,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 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-11-25 15:45:55,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:55,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 15:45:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:55,853 INFO L130 PetriNetUnfolder]: 2540/3687 cut-off events. [2022-11-25 15:45:55,853 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-11-25 15:45:55,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7639 conditions, 3687 events. 2540/3687 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 19178 event pairs, 263 based on Foata normal form. 180/3730 useless extension candidates. Maximal degree in co-relation 7635. Up to 2296 conditions per place. [2022-11-25 15:45:55,875 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 46 selfloop transitions, 6 changer transitions 1/57 dead transitions. [2022-11-25 15:45:55,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 242 flow [2022-11-25 15:45:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:45:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:45:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-11-25 15:45:55,879 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4890202702702703 [2022-11-25 15:45:55,879 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-11-25 15:45:55,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-11-25 15:45:55,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:55,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-11-25 15:45:55,881 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-11-25 15:45:55,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:55,884 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:55,885 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 4 states and 579 transitions. [2022-11-25 15:45:55,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 242 flow [2022-11-25 15:45:55,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:55,889 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 106 flow [2022-11-25 15:45:55,889 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-11-25 15:45:55,890 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-11-25 15:45:55,891 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 106 flow [2022-11-25 15:45:55,892 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-11-25 15:45:55,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:55,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:55,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:56,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:56,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:56,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2053902543, now seen corresponding path program 1 times [2022-11-25 15:45:56,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:56,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041304381] [2022-11-25 15:45:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:56,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:56,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 15:45:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:56,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:45:56,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:56,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:56,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:45:56,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041304381] [2022-11-25 15:45:56,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041304381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:56,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:56,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934157777] [2022-11-25 15:45:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:56,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:56,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:56,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 15:45:56,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:56,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:56,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 15:45:56,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:56,890 INFO L130 PetriNetUnfolder]: 1284/1991 cut-off events. [2022-11-25 15:45:56,891 INFO L131 PetriNetUnfolder]: For 663/667 co-relation queries the response was YES. [2022-11-25 15:45:56,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5154 conditions, 1991 events. 1284/1991 cut-off events. For 663/667 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9772 event pairs, 121 based on Foata normal form. 134/2064 useless extension candidates. Maximal degree in co-relation 5148. Up to 776 conditions per place. [2022-11-25 15:45:56,909 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 57 selfloop transitions, 10 changer transitions 1/72 dead transitions. [2022-11-25 15:45:56,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 351 flow [2022-11-25 15:45:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2022-11-25 15:45:56,913 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2022-11-25 15:45:56,913 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2022-11-25 15:45:56,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2022-11-25 15:45:56,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:56,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2022-11-25 15:45:56,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:56,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:56,921 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:56,922 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 106 flow. Second operand 5 states and 725 transitions. [2022-11-25 15:45:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 351 flow [2022-11-25 15:45:56,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 340 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:56,928 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 158 flow [2022-11-25 15:45:56,928 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-11-25 15:45:56,930 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-11-25 15:45:56,930 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 158 flow [2022-11-25 15:45:56,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:56,931 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:56,932 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:56,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:57,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:57,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1372618906, now seen corresponding path program 1 times [2022-11-25 15:45:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:57,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245028451] [2022-11-25 15:45:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:57,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:57,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:57,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 15:45:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:57,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:45:57,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:57,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:57,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:45:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245028451] [2022-11-25 15:45:57,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245028451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:57,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:57,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933213155] [2022-11-25 15:45:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:57,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:57,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 15:45:57,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:57,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:57,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 15:45:57,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:57,888 INFO L130 PetriNetUnfolder]: 660/1071 cut-off events. [2022-11-25 15:45:57,888 INFO L131 PetriNetUnfolder]: For 1069/1077 co-relation queries the response was YES. [2022-11-25 15:45:57,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 1071 events. 660/1071 cut-off events. For 1069/1077 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4683 event pairs, 119 based on Foata normal form. 60/1114 useless extension candidates. Maximal degree in co-relation 3286. Up to 351 conditions per place. [2022-11-25 15:45:57,897 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 66 selfloop transitions, 14 changer transitions 1/85 dead transitions. [2022-11-25 15:45:57,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 466 flow [2022-11-25 15:45:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:45:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2022-11-25 15:45:57,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48930180180180183 [2022-11-25 15:45:57,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 869 transitions. [2022-11-25 15:45:57,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 869 transitions. [2022-11-25 15:45:57,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:57,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 869 transitions. [2022-11-25 15:45:57,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:57,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:57,911 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:57,911 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 158 flow. Second operand 6 states and 869 transitions. [2022-11-25 15:45:57,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 85 transitions, 466 flow [2022-11-25 15:45:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 436 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 15:45:57,924 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 208 flow [2022-11-25 15:45:57,924 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-25 15:45:57,925 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2022-11-25 15:45:57,925 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 208 flow [2022-11-25 15:45:57,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:57,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:57,926 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:57,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:58,152 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 972116592, now seen corresponding path program 1 times [2022-11-25 15:45:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:58,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485368945] [2022-11-25 15:45:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:58,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:58,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:58,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 15:45:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:58,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 15:45:58,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:45:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:58,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:45:58,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:45:58,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485368945] [2022-11-25 15:45:58,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485368945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:58,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:58,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:45:58,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336884745] [2022-11-25 15:45:58,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:58,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:45:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:58,438 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 296 [2022-11-25 15:45:58,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:58,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:58,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 296 [2022-11-25 15:45:58,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:58,983 INFO L130 PetriNetUnfolder]: 528/840 cut-off events. [2022-11-25 15:45:58,983 INFO L131 PetriNetUnfolder]: For 968/976 co-relation queries the response was YES. [2022-11-25 15:45:58,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 840 events. 528/840 cut-off events. For 968/976 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3500 event pairs, 119 based on Foata normal form. 16/850 useless extension candidates. Maximal degree in co-relation 2684. Up to 340 conditions per place. [2022-11-25 15:45:58,990 INFO L137 encePairwiseOnDemand]: 289/296 looper letters, 51 selfloop transitions, 18 changer transitions 1/74 dead transitions. [2022-11-25 15:45:58,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 432 flow [2022-11-25 15:45:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2022-11-25 15:45:58,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47731660231660233 [2022-11-25 15:45:58,994 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2022-11-25 15:45:58,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2022-11-25 15:45:58,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:58,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2022-11-25 15:45:58,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:59,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:59,002 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:59,002 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 208 flow. Second operand 7 states and 989 transitions. [2022-11-25 15:45:59,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 432 flow [2022-11-25 15:45:59,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 386 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-25 15:45:59,010 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 218 flow [2022-11-25 15:45:59,011 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2022-11-25 15:45:59,011 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-11-25 15:45:59,012 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 218 flow [2022-11-25 15:45:59,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:59,012 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:59,013 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] [2022-11-25 15:45:59,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:45:59,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:59,235 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:45:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 470185098, now seen corresponding path program 1 times [2022-11-25 15:45:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:45:59,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948972386] [2022-11-25 15:45:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:45:59,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:45:59,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:45:59,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 15:45:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:59,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 15:45:59,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:00,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:00,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:00,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948972386] [2022-11-25 15:46:00,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948972386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:00,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:00,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:46:00,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149423446] [2022-11-25 15:46:00,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:00,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:46:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:46:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:46:00,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 296 [2022-11-25 15:46:00,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 218 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-11-25 15:46:00,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:00,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 296 [2022-11-25 15:46:00,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:01,460 INFO L130 PetriNetUnfolder]: 518/840 cut-off events. [2022-11-25 15:46:01,461 INFO L131 PetriNetUnfolder]: For 1380/1384 co-relation queries the response was YES. [2022-11-25 15:46:01,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 840 events. 518/840 cut-off events. For 1380/1384 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3951 event pairs, 2 based on Foata normal form. 1/839 useless extension candidates. Maximal degree in co-relation 2597. Up to 670 conditions per place. [2022-11-25 15:46:01,466 INFO L137 encePairwiseOnDemand]: 291/296 looper letters, 52 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2022-11-25 15:46:01,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 454 flow [2022-11-25 15:46:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:46:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:46:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2022-11-25 15:46:01,470 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.419481981981982 [2022-11-25 15:46:01,470 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2022-11-25 15:46:01,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2022-11-25 15:46:01,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:01,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2022-11-25 15:46:01,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:01,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:01,476 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 296.0) internal successors, (2072), 7 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:01,476 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 218 flow. Second operand 6 states and 745 transitions. [2022-11-25 15:46:01,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 454 flow [2022-11-25 15:46:01,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 300 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-11-25 15:46:01,480 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 126 flow [2022-11-25 15:46:01,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-11-25 15:46:01,481 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-11-25 15:46:01,481 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 126 flow [2022-11-25 15:46:01,482 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-11-25 15:46:01,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:01,482 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] [2022-11-25 15:46:01,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:01,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:46:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1007006384, now seen corresponding path program 1 times [2022-11-25 15:46:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:01,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047436685] [2022-11-25 15:46:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:01,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:01,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:01,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 15:46:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:01,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:46:01,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:01,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:01,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047436685] [2022-11-25 15:46:01,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047436685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:01,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:01,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:46:01,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566167059] [2022-11-25 15:46:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:01,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:46:01,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:46:01,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:46:01,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 296 [2022-11-25 15:46:01,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:01,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:01,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 296 [2022-11-25 15:46:01,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:02,386 INFO L130 PetriNetUnfolder]: 909/1596 cut-off events. [2022-11-25 15:46:02,387 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2022-11-25 15:46:02,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 1596 events. 909/1596 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8920 event pairs, 167 based on Foata normal form. 1/1597 useless extension candidates. Maximal degree in co-relation 3701. Up to 740 conditions per place. [2022-11-25 15:46:02,395 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 53 selfloop transitions, 1 changer transitions 30/87 dead transitions. [2022-11-25 15:46:02,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 454 flow [2022-11-25 15:46:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:46:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:46:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2022-11-25 15:46:02,398 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2022-11-25 15:46:02,398 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2022-11-25 15:46:02,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2022-11-25 15:46:02,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:02,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2022-11-25 15:46:02,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:02,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:02,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:02,404 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 126 flow. Second operand 5 states and 715 transitions. [2022-11-25 15:46:02,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 454 flow [2022-11-25 15:46:02,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 87 transitions, 441 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:46:02,408 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 128 flow [2022-11-25 15:46:02,409 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2022-11-25 15:46:02,412 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-11-25 15:46:02,412 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 128 flow [2022-11-25 15:46:02,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:02,413 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:02,413 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] [2022-11-25 15:46:02,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:02,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:02,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:46:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 493617706, now seen corresponding path program 2 times [2022-11-25 15:46:02,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:02,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106833261] [2022-11-25 15:46:02,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:46:02,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:02,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:02,638 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:02,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 15:46:02,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:46:02,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:02,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:46:02,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:02,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:02,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:02,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106833261] [2022-11-25 15:46:02,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106833261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:02,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:02,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:46:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198052519] [2022-11-25 15:46:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:02,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:46:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:46:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:46:02,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 296 [2022-11-25 15:46:02,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:02,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:02,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 296 [2022-11-25 15:46:02,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:03,299 INFO L130 PetriNetUnfolder]: 849/1482 cut-off events. [2022-11-25 15:46:03,299 INFO L131 PetriNetUnfolder]: For 821/846 co-relation queries the response was YES. [2022-11-25 15:46:03,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3651 conditions, 1482 events. 849/1482 cut-off events. For 821/846 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8325 event pairs, 150 based on Foata normal form. 2/1467 useless extension candidates. Maximal degree in co-relation 3644. Up to 820 conditions per place. [2022-11-25 15:46:03,306 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 1 changer transitions 38/84 dead transitions. [2022-11-25 15:46:03,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 444 flow [2022-11-25 15:46:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:46:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:46:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-11-25 15:46:03,309 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810810810810811 [2022-11-25 15:46:03,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-11-25 15:46:03,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-11-25 15:46:03,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:03,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-11-25 15:46:03,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:03,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:03,315 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:03,315 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 128 flow. Second operand 5 states and 712 transitions. [2022-11-25 15:46:03,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 444 flow [2022-11-25 15:46:03,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 435 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:46:03,320 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 132 flow [2022-11-25 15:46:03,320 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-11-25 15:46:03,321 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-11-25 15:46:03,321 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 132 flow [2022-11-25 15:46:03,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:03,321 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:03,322 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] [2022-11-25 15:46:03,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:03,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:03,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:46:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1553400242, now seen corresponding path program 3 times [2022-11-25 15:46:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908459397] [2022-11-25 15:46:03,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:46:03,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:03,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:03,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:03,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 15:46:03,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 15:46:03,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:46:03,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:46:03,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:03,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:03,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:03,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908459397] [2022-11-25 15:46:03,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908459397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:03,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:03,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:46:03,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716983946] [2022-11-25 15:46:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:03,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:46:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:46:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:46:03,779 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 296 [2022-11-25 15:46:03,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:03,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:03,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 296 [2022-11-25 15:46:03,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:04,172 INFO L130 PetriNetUnfolder]: 1188/1894 cut-off events. [2022-11-25 15:46:04,173 INFO L131 PetriNetUnfolder]: For 933/934 co-relation queries the response was YES. [2022-11-25 15:46:04,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4992 conditions, 1894 events. 1188/1894 cut-off events. For 933/934 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9425 event pairs, 204 based on Foata normal form. 1/1843 useless extension candidates. Maximal degree in co-relation 4984. Up to 1000 conditions per place. [2022-11-25 15:46:04,179 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 45 selfloop transitions, 1 changer transitions 33/82 dead transitions. [2022-11-25 15:46:04,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 440 flow [2022-11-25 15:46:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:46:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:46:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2022-11-25 15:46:04,184 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2022-11-25 15:46:04,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2022-11-25 15:46:04,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2022-11-25 15:46:04,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:04,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2022-11-25 15:46:04,187 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-11-25 15:46:04,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:04,190 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:04,190 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 132 flow. Second operand 5 states and 710 transitions. [2022-11-25 15:46:04,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 440 flow [2022-11-25 15:46:04,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 431 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:46:04,193 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 136 flow [2022-11-25 15:46:04,194 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-11-25 15:46:04,194 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2022-11-25 15:46:04,194 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 136 flow [2022-11-25 15:46:04,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:04,195 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:04,195 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] [2022-11-25 15:46:04,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:04,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:04,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 15:46:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2100687954, now seen corresponding path program 4 times [2022-11-25 15:46:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:04,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582522241] [2022-11-25 15:46:04,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 15:46:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:04,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:04,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:04,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 15:46:04,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 15:46:04,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 15:46:04,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:46:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:46:04,787 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 15:46:04,788 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:46:04,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 15:46:04,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 15:46:04,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 15:46:04,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 15:46:04,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 15:46:04,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 15:46:04,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 15:46:04,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 15:46:04,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 15:46:04,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 15:46:04,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 15:46:04,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 15:46:04,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 15:46:04,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 15:46:04,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 15:46:04,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 15:46:04,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:05,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:05,007 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:05,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:46:05,013 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:46:05,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:46:05 BasicIcfg [2022-11-25 15:46:05,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:46:05,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:46:05,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:46:05,128 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:46:05,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:40" (3/4) ... [2022-11-25 15:46:05,131 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:46:05,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:46:05,132 INFO L158 Benchmark]: Toolchain (without parser) took 26877.60ms. Allocated memory was 96.5MB in the beginning and 541.1MB in the end (delta: 444.6MB). Free memory was 72.9MB in the beginning and 215.4MB in the end (delta: -142.5MB). Peak memory consumption was 303.4MB. Max. memory is 16.1GB. [2022-11-25 15:46:05,132 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:46:05,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 811.00ms. Allocated memory is still 96.5MB. Free memory was 72.6MB in the beginning and 69.0MB in the end (delta: 3.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-11-25 15:46:05,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.71ms. Allocated memory is still 96.5MB. Free memory was 69.0MB in the beginning and 66.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:46:05,134 INFO L158 Benchmark]: Boogie Preprocessor took 73.74ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:46:05,134 INFO L158 Benchmark]: RCFGBuilder took 1120.24ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 44.3MB in the end (delta: 19.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-11-25 15:46:05,134 INFO L158 Benchmark]: TraceAbstraction took 24755.22ms. Allocated memory was 96.5MB in the beginning and 541.1MB in the end (delta: 444.6MB). Free memory was 72.2MB in the beginning and 215.4MB in the end (delta: -143.2MB). Peak memory consumption was 299.8MB. Max. memory is 16.1GB. [2022-11-25 15:46:05,135 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 541.1MB. Free memory is still 215.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:46:05,137 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.31ms. Allocated memory is still 73.4MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 811.00ms. Allocated memory is still 96.5MB. Free memory was 72.6MB in the beginning and 69.0MB in the end (delta: 3.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.71ms. Allocated memory is still 96.5MB. Free memory was 69.0MB in the beginning and 66.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.74ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 64.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1120.24ms. Allocated memory is still 96.5MB. Free memory was 64.0MB in the beginning and 44.3MB in the end (delta: 19.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24755.22ms. Allocated memory was 96.5MB in the beginning and 541.1MB in the end (delta: 444.6MB). Free memory was 72.2MB in the beginning and 215.4MB in the end (delta: -143.2MB). Peak memory consumption was 299.8MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 541.1MB. Free memory is still 215.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.0s, 158 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 3394 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 8545 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5237, independent: 5038, independent conditional: 0, independent unconditional: 5038, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2515, independent: 2453, independent conditional: 0, independent unconditional: 2453, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2515, independent: 2423, independent conditional: 0, independent unconditional: 2423, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 618, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 530, dependent conditional: 0, dependent unconditional: 530, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5237, independent: 2585, independent conditional: 0, independent unconditional: 2585, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 2515, unknown conditional: 0, unknown unconditional: 2515] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 316, Positive conditional cache size: 0, Positive unconditional cache size: 316, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=0, t325={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=1, t325={3:0}, t326={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=2, t325={3:0}, t326={7:0}, t327={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=3, t325={3:0}, t326={7:0}, t327={11:0}, t328={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L789] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 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_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t325={3:0}, t326={7:0}, t327={11:0}, t328={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t325={3:0}, t326={7:0}, t327={11:0}, t328={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 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_p1_EAX=1, __unbuffered_p1_EBX=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 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: 24.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 20 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=6, InterpolantAutomatonStates: 48, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 20 QuantifiedInterpolants, 1585 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1554 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:46:05,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d4a24d-6ed6-47c2-b58c-13ee24ea5bf5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample