./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:14:30,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:14:30,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:14:30,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:14:30,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:14:30,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:14:30,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:14:30,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:14:30,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:14:30,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:14:30,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:14:30,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:14:30,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:14:30,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:14:30,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:14:30,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:14:30,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:14:30,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:14:30,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:14:30,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:14:30,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:14:30,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:14:30,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:14:30,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:14:30,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:14:30,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:14:30,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:14:30,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:14:30,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:14:30,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:14:30,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:14:30,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:14:30,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:14:30,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:14:30,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:14:30,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:14:30,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:14:30,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:14:30,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:14:30,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:14:30,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:14:30,441 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:14:30,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:14:30,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:14:30,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:14:30,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:14:30,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:14:30,456 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:14:30,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:14:30,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:14:30,456 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:14:30,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:14:30,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:14:30,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:14:30,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:14:30,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:14:30,458 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:14:30,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:14:30,459 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:14:30,459 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_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 [2022-12-13 18:14:30,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:14:30,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:14:30,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:14:30,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:14:30,695 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:14:30,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 18:14:33,300 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:14:33,470 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:14:33,471 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 18:14:33,480 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/data/20bfdbbc6/e03c0ef0676443c0b92a65199e0d253b/FLAGaf4de1e5c [2022-12-13 18:14:33,491 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/data/20bfdbbc6/e03c0ef0676443c0b92a65199e0d253b [2022-12-13 18:14:33,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:14:33,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:14:33,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:14:33,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:14:33,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:14:33,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:14:33" (1/1) ... [2022-12-13 18:14:33,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34242dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:33, skipping insertion in model container [2022-12-13 18:14:33,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:14:33" (1/1) ... [2022-12-13 18:14:33,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:14:33,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:14:33,703 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_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 18:14:33,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:14:33,927 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:14:33,938 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_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 18:14:33,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:33,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:33,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:14:34,018 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:14:34,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34 WrapperNode [2022-12-13 18:14:34,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:14:34,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:14:34,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:14:34,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:14:34,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,063 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 18:14:34,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:14:34,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:14:34,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:14:34,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:14:34,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:14:34,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:14:34,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:14:34,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:14:34,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (1/1) ... [2022-12-13 18:14:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:14:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:14:34,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:14:34,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:14:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:14:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:14:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:14:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:14:34,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:14:34,160 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 18:14:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 18:14:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:14:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:14:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:14:34,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:14:34,162 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 18:14:34,264 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:14:34,266 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:14:34,530 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:14:34,642 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:14:34,642 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:14:34,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:34 BoogieIcfgContainer [2022-12-13 18:14:34,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:14:34,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:14:34,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:14:34,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:14:34,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:14:33" (1/3) ... [2022-12-13 18:14:34,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3f07be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:14:34, skipping insertion in model container [2022-12-13 18:14:34,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:34" (2/3) ... [2022-12-13 18:14:34,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3f07be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:14:34, skipping insertion in model container [2022-12-13 18:14:34,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:34" (3/3) ... [2022-12-13 18:14:34,653 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 18:14:34,662 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 18:14:34,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:14:34,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 18:14:34,670 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:14:34,732 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:14:34,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-12-13 18:14:34,800 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-13 18:14:34,800 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:14:34,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 18:14:34,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2022-12-13 18:14:34,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2022-12-13 18:14:34,812 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:14:34,820 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow [2022-12-13 18:14:34,822 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow [2022-12-13 18:14:34,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow [2022-12-13 18:14:34,874 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-13 18:14:34,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:14:34,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-13 18:14:34,877 INFO L119 LiptonReduction]: Number of co-enabled transitions 3290 [2022-12-13 18:14:37,794 INFO L134 LiptonReduction]: Checked pairs total: 8949 [2022-12-13 18:14:37,795 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-12-13 18:14:37,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:14:37,812 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2604b30a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:14:37,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 18:14:37,815 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 18:14:37,815 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:14:37,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:37,816 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:14:37,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:37,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:37,820 INFO L85 PathProgramCache]: Analyzing trace with hash 561285, now seen corresponding path program 1 times [2022-12-13 18:14:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230243398] [2022-12-13 18:14:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:37,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:38,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230243398] [2022-12-13 18:14:38,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230243398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:38,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:38,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:14:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099656542] [2022-12-13 18:14:38,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:38,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:14:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:38,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:14:38,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:14:38,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-12-13 18:14:38,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:38,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:38,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-12-13 18:14:38,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:39,027 INFO L130 PetriNetUnfolder]: 4903/6902 cut-off events. [2022-12-13 18:14:39,027 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 18:14:39,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13750 conditions, 6902 events. 4903/6902 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 36468 event pairs, 1327 based on Foata normal form. 0/6577 useless extension candidates. Maximal degree in co-relation 13738. Up to 5335 conditions per place. [2022-12-13 18:14:39,074 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2022-12-13 18:14:39,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2022-12-13 18:14:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:14:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:14:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-12-13 18:14:39,084 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-13 18:14:39,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-12-13 18:14:39,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-12-13 18:14:39,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:39,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-12-13 18:14:39,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:39,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:39,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:39,099 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 405 transitions. [2022-12-13 18:14:39,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2022-12-13 18:14:39,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:14:39,106 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2022-12-13 18:14:39,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-13 18:14:39,111 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-13 18:14:39,112 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2022-12-13 18:14:39,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:39,112 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:39,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:39,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:14:39,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 559054189, now seen corresponding path program 1 times [2022-12-13 18:14:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:39,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941869069] [2022-12-13 18:14:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941869069] [2022-12-13 18:14:39,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941869069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:39,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:39,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:14:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771361420] [2022-12-13 18:14:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:39,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:14:39,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:39,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:14:39,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:14:39,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-12-13 18:14:39,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:39,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:39,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-12-13 18:14:39,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:39,969 INFO L130 PetriNetUnfolder]: 4855/6965 cut-off events. [2022-12-13 18:14:39,970 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-12-13 18:14:39,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14245 conditions, 6965 events. 4855/6965 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 37401 event pairs, 1081 based on Foata normal form. 40/7004 useless extension candidates. Maximal degree in co-relation 14235. Up to 6211 conditions per place. [2022-12-13 18:14:40,010 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 38 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 18:14:40,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 186 flow [2022-12-13 18:14:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:14:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:14:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2022-12-13 18:14:40,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.524 [2022-12-13 18:14:40,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2022-12-13 18:14:40,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2022-12-13 18:14:40,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:40,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2022-12-13 18:14:40,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:40,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:40,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:40,022 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 393 transitions. [2022-12-13 18:14:40,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 186 flow [2022-12-13 18:14:40,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:14:40,024 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2022-12-13 18:14:40,024 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 18:14:40,025 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-12-13 18:14:40,025 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2022-12-13 18:14:40,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:40,026 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:40,026 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:40,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:14:40,026 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash 150809161, now seen corresponding path program 1 times [2022-12-13 18:14:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:40,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370991377] [2022-12-13 18:14:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370991377] [2022-12-13 18:14:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370991377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:40,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:40,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:14:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041247670] [2022-12-13 18:14:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:40,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:14:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:14:40,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:14:40,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 250 [2022-12-13 18:14:40,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:40,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:40,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 250 [2022-12-13 18:14:40,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:41,679 INFO L130 PetriNetUnfolder]: 12891/17616 cut-off events. [2022-12-13 18:14:41,679 INFO L131 PetriNetUnfolder]: For 1732/1732 co-relation queries the response was YES. [2022-12-13 18:14:41,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38200 conditions, 17616 events. 12891/17616 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 94472 event pairs, 1247 based on Foata normal form. 535/18151 useless extension candidates. Maximal degree in co-relation 38189. Up to 9627 conditions per place. [2022-12-13 18:14:41,743 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 61 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2022-12-13 18:14:41,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 334 flow [2022-12-13 18:14:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:14:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:14:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2022-12-13 18:14:41,747 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.514 [2022-12-13 18:14:41,747 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2022-12-13 18:14:41,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2022-12-13 18:14:41,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:41,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2022-12-13 18:14:41,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:41,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:41,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:41,755 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 4 states and 514 transitions. [2022-12-13 18:14:41,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 334 flow [2022-12-13 18:14:41,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:14:41,758 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 170 flow [2022-12-13 18:14:41,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 18:14:41,759 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-13 18:14:41,759 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 170 flow [2022-12-13 18:14:41,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:41,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:41,760 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:41,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:14:41,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash -179429048, now seen corresponding path program 1 times [2022-12-13 18:14:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933591984] [2022-12-13 18:14:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:41,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:41,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933591984] [2022-12-13 18:14:41,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933591984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:41,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:41,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:14:41,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506022160] [2022-12-13 18:14:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:41,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:14:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:14:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:14:41,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 18:14:41,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:41,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:41,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 18:14:41,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:43,241 INFO L130 PetriNetUnfolder]: 8330/12229 cut-off events. [2022-12-13 18:14:43,241 INFO L131 PetriNetUnfolder]: For 7379/7719 co-relation queries the response was YES. [2022-12-13 18:14:43,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30165 conditions, 12229 events. 8330/12229 cut-off events. For 7379/7719 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 75264 event pairs, 1490 based on Foata normal form. 1048/12996 useless extension candidates. Maximal degree in co-relation 30150. Up to 7718 conditions per place. [2022-12-13 18:14:43,284 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 84 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2022-12-13 18:14:43,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 103 transitions, 600 flow [2022-12-13 18:14:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:14:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:14:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2022-12-13 18:14:43,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5136 [2022-12-13 18:14:43,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2022-12-13 18:14:43,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2022-12-13 18:14:43,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:43,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2022-12-13 18:14:43,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:43,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:43,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:43,290 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 170 flow. Second operand 5 states and 642 transitions. [2022-12-13 18:14:43,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 103 transitions, 600 flow [2022-12-13 18:14:43,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 103 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:14:43,293 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 245 flow [2022-12-13 18:14:43,293 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=170, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-13 18:14:43,293 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-13 18:14:43,294 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 245 flow [2022-12-13 18:14:43,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:43,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:43,294 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:43,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:14:43,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1290796188, now seen corresponding path program 1 times [2022-12-13 18:14:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:43,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898002503] [2022-12-13 18:14:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:43,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898002503] [2022-12-13 18:14:43,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898002503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:43,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:43,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:14:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028714536] [2022-12-13 18:14:43,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:43,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:14:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:43,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:14:43,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:14:43,442 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 250 [2022-12-13 18:14:43,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:43,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:43,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 250 [2022-12-13 18:14:43,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:45,611 INFO L130 PetriNetUnfolder]: 15554/22250 cut-off events. [2022-12-13 18:14:45,611 INFO L131 PetriNetUnfolder]: For 26576/26576 co-relation queries the response was YES. [2022-12-13 18:14:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72446 conditions, 22250 events. 15554/22250 cut-off events. For 26576/26576 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 133615 event pairs, 3701 based on Foata normal form. 223/22473 useless extension candidates. Maximal degree in co-relation 72426. Up to 9856 conditions per place. [2022-12-13 18:14:45,682 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 78 selfloop transitions, 15 changer transitions 19/112 dead transitions. [2022-12-13 18:14:45,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 767 flow [2022-12-13 18:14:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:14:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:14:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2022-12-13 18:14:45,684 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515 [2022-12-13 18:14:45,684 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2022-12-13 18:14:45,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2022-12-13 18:14:45,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:45,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2022-12-13 18:14:45,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:45,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:45,688 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:45,688 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 245 flow. Second operand 4 states and 515 transitions. [2022-12-13 18:14:45,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 767 flow [2022-12-13 18:14:45,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:14:45,727 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 330 flow [2022-12-13 18:14:45,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 18:14:45,727 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2022-12-13 18:14:45,728 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 330 flow [2022-12-13 18:14:45,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:45,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:45,728 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:45,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:14:45,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -673724338, now seen corresponding path program 1 times [2022-12-13 18:14:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:45,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495861057] [2022-12-13 18:14:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:45,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:45,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495861057] [2022-12-13 18:14:45,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495861057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:45,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:45,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:14:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022160093] [2022-12-13 18:14:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:45,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:14:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:14:45,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:14:45,869 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 18:14:45,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:45,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:45,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 18:14:45,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:47,054 INFO L130 PetriNetUnfolder]: 6721/10344 cut-off events. [2022-12-13 18:14:47,054 INFO L131 PetriNetUnfolder]: For 15713/16262 co-relation queries the response was YES. [2022-12-13 18:14:47,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33637 conditions, 10344 events. 6721/10344 cut-off events. For 15713/16262 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 66683 event pairs, 958 based on Foata normal form. 1110/11253 useless extension candidates. Maximal degree in co-relation 33613. Up to 3691 conditions per place. [2022-12-13 18:14:47,103 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 106 selfloop transitions, 14 changer transitions 10/141 dead transitions. [2022-12-13 18:14:47,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 141 transitions, 1120 flow [2022-12-13 18:14:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:14:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:14:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2022-12-13 18:14:47,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5153333333333333 [2022-12-13 18:14:47,107 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2022-12-13 18:14:47,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2022-12-13 18:14:47,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:47,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2022-12-13 18:14:47,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:47,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:47,116 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:47,116 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 330 flow. Second operand 6 states and 773 transitions. [2022-12-13 18:14:47,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 141 transitions, 1120 flow [2022-12-13 18:14:47,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 141 transitions, 1118 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 18:14:47,185 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 448 flow [2022-12-13 18:14:47,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-13 18:14:47,186 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-12-13 18:14:47,187 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 448 flow [2022-12-13 18:14:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:47,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:47,187 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:14:47,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2116850773, now seen corresponding path program 1 times [2022-12-13 18:14:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:47,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525997665] [2022-12-13 18:14:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525997665] [2022-12-13 18:14:47,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525997665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:47,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:47,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:14:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838606653] [2022-12-13 18:14:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:47,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:14:47,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:14:47,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:14:47,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 18:14:47,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:47,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:47,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 18:14:47,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:48,793 INFO L130 PetriNetUnfolder]: 6003/9251 cut-off events. [2022-12-13 18:14:48,793 INFO L131 PetriNetUnfolder]: For 19587/20111 co-relation queries the response was YES. [2022-12-13 18:14:48,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35532 conditions, 9251 events. 6003/9251 cut-off events. For 19587/20111 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 59268 event pairs, 791 based on Foata normal form. 557/9623 useless extension candidates. Maximal degree in co-relation 35504. Up to 3452 conditions per place. [2022-12-13 18:14:48,834 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 113 selfloop transitions, 22 changer transitions 34/180 dead transitions. [2022-12-13 18:14:48,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 180 transitions, 1536 flow [2022-12-13 18:14:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:14:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:14:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions. [2022-12-13 18:14:48,837 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515 [2022-12-13 18:14:48,837 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions. [2022-12-13 18:14:48,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions. [2022-12-13 18:14:48,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:48,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions. [2022-12-13 18:14:48,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:48,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:48,842 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:48,842 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 448 flow. Second operand 8 states and 1030 transitions. [2022-12-13 18:14:48,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 180 transitions, 1536 flow [2022-12-13 18:14:49,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 180 transitions, 1481 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 18:14:49,411 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 553 flow [2022-12-13 18:14:49,411 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=553, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2022-12-13 18:14:49,412 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-13 18:14:49,412 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 553 flow [2022-12-13 18:14:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:49,412 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:49,412 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] [2022-12-13 18:14:49,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:14:49,412 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1090229452, now seen corresponding path program 1 times [2022-12-13 18:14:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:49,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390317298] [2022-12-13 18:14:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390317298] [2022-12-13 18:14:49,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390317298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:49,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:49,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:14:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101462736] [2022-12-13 18:14:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:49,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:14:49,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:14:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:14:49,590 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 18:14:49,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 553 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:49,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:49,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 18:14:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:50,836 INFO L130 PetriNetUnfolder]: 5829/9004 cut-off events. [2022-12-13 18:14:50,837 INFO L131 PetriNetUnfolder]: For 22097/22620 co-relation queries the response was YES. [2022-12-13 18:14:50,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34579 conditions, 9004 events. 5829/9004 cut-off events. For 22097/22620 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 58176 event pairs, 781 based on Foata normal form. 283/9103 useless extension candidates. Maximal degree in co-relation 34549. Up to 2261 conditions per place. [2022-12-13 18:14:50,867 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 95 selfloop transitions, 26 changer transitions 52/180 dead transitions. [2022-12-13 18:14:50,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 180 transitions, 1569 flow [2022-12-13 18:14:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:14:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 18:14:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1258 transitions. [2022-12-13 18:14:50,870 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5032 [2022-12-13 18:14:50,870 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1258 transitions. [2022-12-13 18:14:50,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1258 transitions. [2022-12-13 18:14:50,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:50,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1258 transitions. [2022-12-13 18:14:50,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.8) internal successors, (1258), 10 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:50,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:50,875 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:50,875 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 553 flow. Second operand 10 states and 1258 transitions. [2022-12-13 18:14:50,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 180 transitions, 1569 flow [2022-12-13 18:14:51,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 180 transitions, 1470 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-13 18:14:51,647 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 473 flow [2022-12-13 18:14:51,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=473, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2022-12-13 18:14:51,648 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2022-12-13 18:14:51,648 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 473 flow [2022-12-13 18:14:51,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:51,649 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:51,649 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-12-13 18:14:51,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:14:51,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1360044971, now seen corresponding path program 1 times [2022-12-13 18:14:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:51,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520775628] [2022-12-13 18:14:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:52,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520775628] [2022-12-13 18:14:52,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520775628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:52,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:52,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:14:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822409772] [2022-12-13 18:14:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:52,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:14:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:14:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:14:52,851 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-12-13 18:14:52,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 473 flow. Second operand has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:52,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:52,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-12-13 18:14:52,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:53,828 INFO L130 PetriNetUnfolder]: 4278/6834 cut-off events. [2022-12-13 18:14:53,828 INFO L131 PetriNetUnfolder]: For 19088/19275 co-relation queries the response was YES. [2022-12-13 18:14:53,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27581 conditions, 6834 events. 4278/6834 cut-off events. For 19088/19275 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 43927 event pairs, 776 based on Foata normal form. 163/6928 useless extension candidates. Maximal degree in co-relation 27548. Up to 2616 conditions per place. [2022-12-13 18:14:53,853 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 114 selfloop transitions, 10 changer transitions 45/176 dead transitions. [2022-12-13 18:14:53,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 176 transitions, 1673 flow [2022-12-13 18:14:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:14:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:14:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2022-12-13 18:14:53,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.514 [2022-12-13 18:14:53,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2022-12-13 18:14:53,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2022-12-13 18:14:53,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:53,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2022-12-13 18:14:53,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:53,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:53,859 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:53,859 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 473 flow. Second operand 6 states and 771 transitions. [2022-12-13 18:14:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 176 transitions, 1673 flow [2022-12-13 18:14:54,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 176 transitions, 1332 flow, removed 68 selfloop flow, removed 13 redundant places. [2022-12-13 18:14:54,148 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 437 flow [2022-12-13 18:14:54,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2022-12-13 18:14:54,149 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2022-12-13 18:14:54,149 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 437 flow [2022-12-13 18:14:54,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:54,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:54,150 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-12-13 18:14:54,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:14:54,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash 203951359, now seen corresponding path program 2 times [2022-12-13 18:14:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:54,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589506178] [2022-12-13 18:14:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:54,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:54,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589506178] [2022-12-13 18:14:54,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589506178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:54,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:54,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:14:54,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704043181] [2022-12-13 18:14:54,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:54,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:14:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:54,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:14:54,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:14:54,280 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-12-13 18:14:54,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:54,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:54,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-12-13 18:14:54,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:55,107 INFO L130 PetriNetUnfolder]: 5263/8377 cut-off events. [2022-12-13 18:14:55,107 INFO L131 PetriNetUnfolder]: For 16076/16279 co-relation queries the response was YES. [2022-12-13 18:14:55,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32852 conditions, 8377 events. 5263/8377 cut-off events. For 16076/16279 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 54607 event pairs, 1603 based on Foata normal form. 200/8557 useless extension candidates. Maximal degree in co-relation 32828. Up to 3770 conditions per place. [2022-12-13 18:14:55,134 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 63 selfloop transitions, 1 changer transitions 76/144 dead transitions. [2022-12-13 18:14:55,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 144 transitions, 1199 flow [2022-12-13 18:14:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:14:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:14:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2022-12-13 18:14:55,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.514 [2022-12-13 18:14:55,136 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2022-12-13 18:14:55,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2022-12-13 18:14:55,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:55,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2022-12-13 18:14:55,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:55,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:55,139 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:55,139 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 437 flow. Second operand 4 states and 514 transitions. [2022-12-13 18:14:55,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 144 transitions, 1199 flow [2022-12-13 18:14:55,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 144 transitions, 1182 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 18:14:55,349 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 318 flow [2022-12-13 18:14:55,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2022-12-13 18:14:55,350 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2022-12-13 18:14:55,350 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 318 flow [2022-12-13 18:14:55,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:55,351 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:55,351 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-12-13 18:14:55,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:14:55,351 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:14:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1588463563, now seen corresponding path program 3 times [2022-12-13 18:14:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:55,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372676970] [2022-12-13 18:14:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:14:55,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:14:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:14:55,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:14:55,457 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:14:55,458 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 18:14:55,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 18:14:55,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 18:14:55,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 18:14:55,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 18:14:55,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 18:14:55,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 18:14:55,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:14:55,460 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:55,465 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:14:55,465 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:14:55,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:14:55 BasicIcfg [2022-12-13 18:14:55,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:14:55,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:14:55,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:14:55,526 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:14:55,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:34" (3/4) ... [2022-12-13 18:14:55,528 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 18:14:55,599 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:14:55,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:14:55,600 INFO L158 Benchmark]: Toolchain (without parser) took 22106.35ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 122.7MB in the beginning and 323.1MB in the end (delta: -200.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 18:14:55,600 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 68.8MB in the beginning and 68.7MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:14:55,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.04ms. Allocated memory is still 184.5MB. Free memory was 122.5MB in the beginning and 141.3MB in the end (delta: -18.8MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2022-12-13 18:14:55,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.54ms. Allocated memory is still 184.5MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:14:55,601 INFO L158 Benchmark]: Boogie Preprocessor took 33.29ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 137.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:14:55,601 INFO L158 Benchmark]: RCFGBuilder took 546.24ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 98.3MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 18:14:55,602 INFO L158 Benchmark]: TraceAbstraction took 20877.48ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 97.3MB in the beginning and 337.8MB in the end (delta: -240.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 18:14:55,602 INFO L158 Benchmark]: Witness Printer took 74.20ms. Allocated memory is still 1.5GB. Free memory was 337.8MB in the beginning and 323.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 18:14:55,604 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.14ms. Allocated memory is still 102.8MB. Free memory was 68.8MB in the beginning and 68.7MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.04ms. Allocated memory is still 184.5MB. Free memory was 122.5MB in the beginning and 141.3MB in the end (delta: -18.8MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.54ms. Allocated memory is still 184.5MB. Free memory was 141.3MB in the beginning and 139.2MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.29ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 137.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.24ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 98.3MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20877.48ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 97.3MB in the beginning and 337.8MB in the end (delta: -240.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 74.20ms. Allocated memory is still 1.5GB. Free memory was 337.8MB in the beginning and 323.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 142 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 30 TransitionsAfterwards, 3290 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 8949 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3850, independent: 3617, independent conditional: 0, independent unconditional: 3617, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3850, independent: 1911, independent conditional: 0, independent unconditional: 1911, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 1755, unknown conditional: 0, unknown unconditional: 1755] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1409, ((void *)0), P0, ((void *)0))=-2, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=-1, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L863] 0 pthread_t t1411; [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=1, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L818] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, x=2, y=2, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=0, x=2, y=2, z=1] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] 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_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: 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: 860]: 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, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 712 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 628 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1342 IncrementalHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 53 mSDtfsCounter, 1342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 proved your program to be incorrect! [2022-12-13 18:14:55,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec6ad1a3-2040-492c-89c5-5865fa7ddf37/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE