./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R --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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:18:55,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:18:55,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:18:55,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:18:55,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:18:55,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:18:55,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:18:55,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:18:55,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:18:55,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:18:55,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:18:55,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:18:55,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:18:55,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:18:55,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:18:55,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:18:55,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:18:55,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:18:55,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:18:55,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:18:55,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:18:55,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:18:55,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:18:55,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:18:55,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:18:55,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:18:55,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:18:55,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:18:55,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:18:55,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:18:55,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:18:55,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:18:55,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:18:55,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:18:55,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:18:55,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:18:55,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:18:55,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:18:55,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:18:55,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:18:55,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:18:55,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:18:55,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:18:55,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:18:55,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:18:55,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:18:55,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:18:55,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:18:55,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:18:55,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:18:55,490 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:18:55,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:18:55,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:18:55,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:18:55,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:18:55,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:18:55,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:18:55,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:18:55,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:18:55,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:18:55,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:18:55,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:18:55,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:18:55,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:18:55,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:18:55,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:18:55,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:18:55,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:18:55,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:18:55,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:18:55,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:18:55,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:18:55,496 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:18:55,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:18:55,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:18:55,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:18:55,498 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_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2022-11-25 18:18:55,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:18:55,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:18:55,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:18:55,842 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:18:55,843 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:18:55,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-25 18:18:58,774 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:18:59,141 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:18:59,142 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-25 18:18:59,161 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/data/025e37468/e34eab0d90034bc3894ba24d65b184fe/FLAG33ff3cf43 [2022-11-25 18:18:59,175 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/data/025e37468/e34eab0d90034bc3894ba24d65b184fe [2022-11-25 18:18:59,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:18:59,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:18:59,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:18:59,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:18:59,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:18:59,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ace4cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59, skipping insertion in model container [2022-11-25 18:18:59,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:18:59,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:18:59,393 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_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-25 18:18:59,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:18:59,697 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:18:59,710 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_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-25 18:18:59,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:18:59,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:18:59,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:18:59,809 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:18:59,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59 WrapperNode [2022-11-25 18:18:59,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:18:59,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:18:59,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:18:59,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:18:59,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,885 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 18:18:59,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:18:59,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:18:59,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:18:59,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:18:59,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,913 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:18:59,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:18:59,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:18:59,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:18:59,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (1/1) ... [2022-11-25 18:18:59,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:18:59,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:59,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:18:59,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:19:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:19:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:19:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:19:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:19:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:19:00,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:19:00,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:19:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:19:00,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:19:00,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:19:00,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:19:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:19:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:19:00,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:19:00,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:19:00,016 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:19:00,152 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:19:00,154 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:19:00,632 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:19:00,807 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:19:00,808 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:19:00,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:00 BoogieIcfgContainer [2022-11-25 18:19:00,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:19:00,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:19:00,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:19:00,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:19:00,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:18:59" (1/3) ... [2022-11-25 18:19:00,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd9e0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:19:00, skipping insertion in model container [2022-11-25 18:19:00,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:18:59" (2/3) ... [2022-11-25 18:19:00,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd9e0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:19:00, skipping insertion in model container [2022-11-25 18:19:00,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:00" (3/3) ... [2022-11-25 18:19:00,823 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-11-25 18:19:00,833 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:19:00,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:19:00,845 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:19:00,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:19:00,930 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:19:00,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-11-25 18:19:01,041 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-25 18:19:01,043 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:19:01,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-25 18:19:01,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-11-25 18:19:01,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-11-25 18:19:01,061 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:19:01,097 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2022-11-25 18:19:01,104 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2022-11-25 18:19:01,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2022-11-25 18:19:01,156 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-11-25 18:19:01,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:19:01,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-11-25 18:19:01,163 INFO L119 LiptonReduction]: Number of co-enabled transitions 2274 [2022-11-25 18:19:06,205 INFO L134 LiptonReduction]: Checked pairs total: 5963 [2022-11-25 18:19:06,206 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-25 18:19:06,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:19:06,228 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;@1973789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:19:06,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:19:06,233 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-11-25 18:19:06,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:19:06,233 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:06,234 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:19:06,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash 484502194, now seen corresponding path program 1 times [2022-11-25 18:19:06,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:06,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385752621] [2022-11-25 18:19:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:06,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385752621] [2022-11-25 18:19:06,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385752621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:06,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:06,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:19:06,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17122007] [2022-11-25 18:19:06,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:06,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:19:06,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:19:06,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:19:06,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 222 [2022-11-25 18:19:06,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:06,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:06,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 222 [2022-11-25 18:19:06,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:07,185 INFO L130 PetriNetUnfolder]: 1079/1694 cut-off events. [2022-11-25 18:19:07,186 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 18:19:07,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3341 conditions, 1694 events. 1079/1694 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8279 event pairs, 275 based on Foata normal form. 0/1609 useless extension candidates. Maximal degree in co-relation 3330. Up to 1285 conditions per place. [2022-11-25 18:19:07,206 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-25 18:19:07,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-11-25 18:19:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:19:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:19:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2022-11-25 18:19:07,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.53003003003003 [2022-11-25 18:19:07,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2022-11-25 18:19:07,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2022-11-25 18:19:07,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:07,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2022-11-25 18:19:07,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:07,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:07,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:07,252 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 353 transitions. [2022-11-25 18:19:07,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-11-25 18:19:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:19:07,257 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2022-11-25 18:19:07,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-11-25 18:19:07,262 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-11-25 18:19:07,263 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2022-11-25 18:19:07,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:07,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:07,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:07,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:19:07,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -591566690, now seen corresponding path program 1 times [2022-11-25 18:19:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:07,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574571015] [2022-11-25 18:19:07,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:08,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574571015] [2022-11-25 18:19:08,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574571015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:08,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:08,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:19:08,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788659450] [2022-11-25 18:19:08,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:08,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:19:08,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:08,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:19:08,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:19:08,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 222 [2022-11-25 18:19:08,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:08,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:08,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 222 [2022-11-25 18:19:08,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:08,938 INFO L130 PetriNetUnfolder]: 1967/2922 cut-off events. [2022-11-25 18:19:08,939 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-11-25 18:19:08,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6094 conditions, 2922 events. 1967/2922 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13275 event pairs, 645 based on Foata normal form. 152/3074 useless extension candidates. Maximal degree in co-relation 6084. Up to 2453 conditions per place. [2022-11-25 18:19:08,957 INFO L137 encePairwiseOnDemand]: 212/222 looper letters, 38 selfloop transitions, 10 changer transitions 28/76 dead transitions. [2022-11-25 18:19:08,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 76 transitions, 332 flow [2022-11-25 18:19:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 772 transitions. [2022-11-25 18:19:08,962 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4967824967824968 [2022-11-25 18:19:08,962 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 772 transitions. [2022-11-25 18:19:08,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 772 transitions. [2022-11-25 18:19:08,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:08,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 772 transitions. [2022-11-25 18:19:08,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:08,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:08,973 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:08,974 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 7 states and 772 transitions. [2022-11-25 18:19:08,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 76 transitions, 332 flow [2022-11-25 18:19:08,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 76 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:19:08,978 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 133 flow [2022-11-25 18:19:08,979 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-11-25 18:19:08,980 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-11-25 18:19:08,980 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 133 flow [2022-11-25 18:19:08,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:08,982 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:08,982 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:08,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:19:08,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1158688441, now seen corresponding path program 1 times [2022-11-25 18:19:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:08,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388958234] [2022-11-25 18:19:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:09,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:09,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388958234] [2022-11-25 18:19:09,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388958234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:09,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:09,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250001291] [2022-11-25 18:19:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:09,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:10,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2022-11-25 18:19:10,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:10,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:10,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2022-11-25 18:19:10,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:10,891 INFO L130 PetriNetUnfolder]: 2068/3059 cut-off events. [2022-11-25 18:19:10,892 INFO L131 PetriNetUnfolder]: For 3457/3457 co-relation queries the response was YES. [2022-11-25 18:19:10,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8914 conditions, 3059 events. 2068/3059 cut-off events. For 3457/3457 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13836 event pairs, 593 based on Foata normal form. 142/3201 useless extension candidates. Maximal degree in co-relation 8899. Up to 2448 conditions per place. [2022-11-25 18:19:10,914 INFO L137 encePairwiseOnDemand]: 211/222 looper letters, 43 selfloop transitions, 18 changer transitions 29/90 dead transitions. [2022-11-25 18:19:10,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 90 transitions, 529 flow [2022-11-25 18:19:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2022-11-25 18:19:10,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47361647361647363 [2022-11-25 18:19:10,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 736 transitions. [2022-11-25 18:19:10,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 736 transitions. [2022-11-25 18:19:10,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:10,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 736 transitions. [2022-11-25 18:19:10,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:10,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:10,925 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:10,926 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 133 flow. Second operand 7 states and 736 transitions. [2022-11-25 18:19:10,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 90 transitions, 529 flow [2022-11-25 18:19:10,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 527 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:19:10,933 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 269 flow [2022-11-25 18:19:10,933 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-11-25 18:19:10,934 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2022-11-25 18:19:10,934 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 269 flow [2022-11-25 18:19:10,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:10,935 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:10,935 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:10,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:19:10,936 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1160360581, now seen corresponding path program 2 times [2022-11-25 18:19:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:10,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205724096] [2022-11-25 18:19:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:11,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205724096] [2022-11-25 18:19:11,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205724096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:11,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:11,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930927094] [2022-11-25 18:19:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:11,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:11,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:11,510 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 222 [2022-11-25 18:19:11,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:11,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:11,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 222 [2022-11-25 18:19:11,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:12,177 INFO L130 PetriNetUnfolder]: 1874/2797 cut-off events. [2022-11-25 18:19:12,177 INFO L131 PetriNetUnfolder]: For 6502/6579 co-relation queries the response was YES. [2022-11-25 18:19:12,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10893 conditions, 2797 events. 1874/2797 cut-off events. For 6502/6579 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12917 event pairs, 334 based on Foata normal form. 160/2927 useless extension candidates. Maximal degree in co-relation 10872. Up to 1694 conditions per place. [2022-11-25 18:19:12,206 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 54 selfloop transitions, 11 changer transitions 28/96 dead transitions. [2022-11-25 18:19:12,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 96 transitions, 741 flow [2022-11-25 18:19:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 738 transitions. [2022-11-25 18:19:12,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4749034749034749 [2022-11-25 18:19:12,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 738 transitions. [2022-11-25 18:19:12,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 738 transitions. [2022-11-25 18:19:12,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:12,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 738 transitions. [2022-11-25 18:19:12,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.42857142857143) internal successors, (738), 7 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:12,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:12,219 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:12,219 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 269 flow. Second operand 7 states and 738 transitions. [2022-11-25 18:19:12,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 96 transitions, 741 flow [2022-11-25 18:19:12,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 681 flow, removed 30 selfloop flow, removed 2 redundant places. [2022-11-25 18:19:12,236 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 356 flow [2022-11-25 18:19:12,236 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-11-25 18:19:12,238 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2022-11-25 18:19:12,238 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 356 flow [2022-11-25 18:19:12,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:12,239 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:12,239 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:12,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:19:12,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1613898147, now seen corresponding path program 1 times [2022-11-25 18:19:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:12,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851722522] [2022-11-25 18:19:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:13,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851722522] [2022-11-25 18:19:13,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851722522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:13,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:13,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281410133] [2022-11-25 18:19:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:13,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:13,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:13,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:13,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 222 [2022-11-25 18:19:13,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:13,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:13,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 222 [2022-11-25 18:19:13,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:13,741 INFO L130 PetriNetUnfolder]: 1572/2447 cut-off events. [2022-11-25 18:19:13,742 INFO L131 PetriNetUnfolder]: For 7848/7848 co-relation queries the response was YES. [2022-11-25 18:19:13,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9730 conditions, 2447 events. 1572/2447 cut-off events. For 7848/7848 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11637 event pairs, 453 based on Foata normal form. 88/2530 useless extension candidates. Maximal degree in co-relation 9704. Up to 1753 conditions per place. [2022-11-25 18:19:13,766 INFO L137 encePairwiseOnDemand]: 215/222 looper letters, 57 selfloop transitions, 11 changer transitions 14/87 dead transitions. [2022-11-25 18:19:13,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 708 flow [2022-11-25 18:19:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2022-11-25 18:19:13,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5097597597597597 [2022-11-25 18:19:13,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2022-11-25 18:19:13,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2022-11-25 18:19:13,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:13,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2022-11-25 18:19:13,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:13,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:13,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:13,776 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 356 flow. Second operand 6 states and 679 transitions. [2022-11-25 18:19:13,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 708 flow [2022-11-25 18:19:13,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 680 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-11-25 18:19:13,794 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 422 flow [2022-11-25 18:19:13,794 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-11-25 18:19:13,796 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2022-11-25 18:19:13,797 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 422 flow [2022-11-25 18:19:13,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:13,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:13,797 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:19:13,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1242175755, now seen corresponding path program 1 times [2022-11-25 18:19:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399703975] [2022-11-25 18:19:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:14,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:14,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399703975] [2022-11-25 18:19:14,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399703975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:14,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:14,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:19:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206549198] [2022-11-25 18:19:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:14,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:19:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:19:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:19:14,202 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2022-11-25 18:19:14,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 422 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:14,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:14,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2022-11-25 18:19:14,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:14,766 INFO L130 PetriNetUnfolder]: 1525/2376 cut-off events. [2022-11-25 18:19:14,767 INFO L131 PetriNetUnfolder]: For 8695/8695 co-relation queries the response was YES. [2022-11-25 18:19:14,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9983 conditions, 2376 events. 1525/2376 cut-off events. For 8695/8695 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11161 event pairs, 408 based on Foata normal form. 60/2436 useless extension candidates. Maximal degree in co-relation 9955. Up to 1674 conditions per place. [2022-11-25 18:19:14,803 INFO L137 encePairwiseOnDemand]: 214/222 looper letters, 54 selfloop transitions, 20 changer transitions 15/94 dead transitions. [2022-11-25 18:19:14,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 94 transitions, 864 flow [2022-11-25 18:19:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-11-25 18:19:14,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5012870012870013 [2022-11-25 18:19:14,806 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2022-11-25 18:19:14,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2022-11-25 18:19:14,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:14,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2022-11-25 18:19:14,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:14,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:14,813 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:14,813 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 422 flow. Second operand 7 states and 779 transitions. [2022-11-25 18:19:14,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 94 transitions, 864 flow [2022-11-25 18:19:14,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 94 transitions, 836 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 18:19:14,851 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 524 flow [2022-11-25 18:19:14,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-11-25 18:19:14,853 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-11-25 18:19:14,854 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 524 flow [2022-11-25 18:19:14,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:14,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:14,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:14,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:19:14,855 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:14,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash -330789045, now seen corresponding path program 2 times [2022-11-25 18:19:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:14,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105006191] [2022-11-25 18:19:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:15,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105006191] [2022-11-25 18:19:15,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105006191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:15,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:15,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570066898] [2022-11-25 18:19:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:15,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:15,316 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2022-11-25 18:19:15,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:15,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:15,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2022-11-25 18:19:15,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:15,893 INFO L130 PetriNetUnfolder]: 1482/2307 cut-off events. [2022-11-25 18:19:15,893 INFO L131 PetriNetUnfolder]: For 12714/12724 co-relation queries the response was YES. [2022-11-25 18:19:15,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10586 conditions, 2307 events. 1482/2307 cut-off events. For 12714/12724 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10809 event pairs, 302 based on Foata normal form. 60/2360 useless extension candidates. Maximal degree in co-relation 10555. Up to 1651 conditions per place. [2022-11-25 18:19:15,914 INFO L137 encePairwiseOnDemand]: 217/222 looper letters, 62 selfloop transitions, 12 changer transitions 12/91 dead transitions. [2022-11-25 18:19:15,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 894 flow [2022-11-25 18:19:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions. [2022-11-25 18:19:15,916 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.503003003003003 [2022-11-25 18:19:15,917 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 670 transitions. [2022-11-25 18:19:15,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions. [2022-11-25 18:19:15,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:15,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions. [2022-11-25 18:19:15,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:15,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:15,922 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:15,922 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 524 flow. Second operand 6 states and 670 transitions. [2022-11-25 18:19:15,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 894 flow [2022-11-25 18:19:15,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 841 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-11-25 18:19:15,959 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 524 flow [2022-11-25 18:19:15,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-11-25 18:19:15,961 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-11-25 18:19:15,961 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 524 flow [2022-11-25 18:19:15,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:15,962 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:15,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:15,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:19:15,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -146584404, now seen corresponding path program 1 times [2022-11-25 18:19:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11251959] [2022-11-25 18:19:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:15,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11251959] [2022-11-25 18:19:16,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11251959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:16,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:16,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624365239] [2022-11-25 18:19:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:16,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:16,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:16,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:16,420 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2022-11-25 18:19:16,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:16,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:16,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2022-11-25 18:19:16,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:17,114 INFO L130 PetriNetUnfolder]: 1525/2372 cut-off events. [2022-11-25 18:19:17,114 INFO L131 PetriNetUnfolder]: For 10705/10711 co-relation queries the response was YES. [2022-11-25 18:19:17,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10535 conditions, 2372 events. 1525/2372 cut-off events. For 10705/10711 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11132 event pairs, 379 based on Foata normal form. 52/2423 useless extension candidates. Maximal degree in co-relation 10504. Up to 1662 conditions per place. [2022-11-25 18:19:17,138 INFO L137 encePairwiseOnDemand]: 213/222 looper letters, 59 selfloop transitions, 25 changer transitions 11/100 dead transitions. [2022-11-25 18:19:17,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 964 flow [2022-11-25 18:19:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 775 transitions. [2022-11-25 18:19:17,142 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49871299871299873 [2022-11-25 18:19:17,142 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 775 transitions. [2022-11-25 18:19:17,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 775 transitions. [2022-11-25 18:19:17,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:17,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 775 transitions. [2022-11-25 18:19:17,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:17,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:17,150 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:17,150 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 524 flow. Second operand 7 states and 775 transitions. [2022-11-25 18:19:17,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 964 flow [2022-11-25 18:19:17,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 942 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 18:19:17,194 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 637 flow [2022-11-25 18:19:17,194 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2022-11-25 18:19:17,197 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2022-11-25 18:19:17,197 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 637 flow [2022-11-25 18:19:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:17,198 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:17,198 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:17,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:19:17,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1663852948, now seen corresponding path program 2 times [2022-11-25 18:19:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:17,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746117548] [2022-11-25 18:19:17,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:17,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:17,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746117548] [2022-11-25 18:19:17,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746117548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:17,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:17,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:19:17,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859914764] [2022-11-25 18:19:17,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:17,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:19:17,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:17,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:19:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:19:17,692 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2022-11-25 18:19:17,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 637 flow. Second operand has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:17,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:17,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2022-11-25 18:19:17,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:18,302 INFO L130 PetriNetUnfolder]: 1564/2432 cut-off events. [2022-11-25 18:19:18,302 INFO L131 PetriNetUnfolder]: For 14624/14640 co-relation queries the response was YES. [2022-11-25 18:19:18,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11853 conditions, 2432 events. 1564/2432 cut-off events. For 14624/14640 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11471 event pairs, 393 based on Foata normal form. 48/2476 useless extension candidates. Maximal degree in co-relation 11822. Up to 1719 conditions per place. [2022-11-25 18:19:18,326 INFO L137 encePairwiseOnDemand]: 213/222 looper letters, 67 selfloop transitions, 32 changer transitions 7/111 dead transitions. [2022-11-25 18:19:18,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 1238 flow [2022-11-25 18:19:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:19:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:19:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2022-11-25 18:19:18,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49774774774774777 [2022-11-25 18:19:18,329 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 663 transitions. [2022-11-25 18:19:18,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions. [2022-11-25 18:19:18,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:18,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions. [2022-11-25 18:19:18,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:18,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:18,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:18,334 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 637 flow. Second operand 6 states and 663 transitions. [2022-11-25 18:19:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 1238 flow [2022-11-25 18:19:18,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 1154 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-11-25 18:19:18,364 INFO L231 Difference]: Finished difference. Result has 65 places, 79 transitions, 886 flow [2022-11-25 18:19:18,364 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=886, PETRI_PLACES=65, PETRI_TRANSITIONS=79} [2022-11-25 18:19:18,365 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-11-25 18:19:18,365 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 79 transitions, 886 flow [2022-11-25 18:19:18,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:18,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:18,368 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:18,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:19:18,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash -98322984, now seen corresponding path program 3 times [2022-11-25 18:19:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:18,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805034483] [2022-11-25 18:19:18,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:18,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:18,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805034483] [2022-11-25 18:19:18,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805034483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:18,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:18,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:19:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867445049] [2022-11-25 18:19:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:18,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:19:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:19:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:19:19,063 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 222 [2022-11-25 18:19:19,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 79 transitions, 886 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:19,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:19,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 222 [2022-11-25 18:19:19,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:20,171 INFO L130 PetriNetUnfolder]: 2185/3255 cut-off events. [2022-11-25 18:19:20,172 INFO L131 PetriNetUnfolder]: For 24873/24873 co-relation queries the response was YES. [2022-11-25 18:19:20,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 3255 events. 2185/3255 cut-off events. For 24873/24873 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15036 event pairs, 266 based on Foata normal form. 71/3326 useless extension candidates. Maximal degree in co-relation 17417. Up to 2100 conditions per place. [2022-11-25 18:19:20,206 INFO L137 encePairwiseOnDemand]: 210/222 looper letters, 97 selfloop transitions, 65 changer transitions 18/180 dead transitions. [2022-11-25 18:19:20,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 180 transitions, 2137 flow [2022-11-25 18:19:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:19:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 18:19:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-11-25 18:19:20,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.459009009009009 [2022-11-25 18:19:20,210 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1019 transitions. [2022-11-25 18:19:20,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1019 transitions. [2022-11-25 18:19:20,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:20,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1019 transitions. [2022-11-25 18:19:20,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.9) internal successors, (1019), 10 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:20,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:20,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 222.0) internal successors, (2442), 11 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:20,219 INFO L175 Difference]: Start difference. First operand has 65 places, 79 transitions, 886 flow. Second operand 10 states and 1019 transitions. [2022-11-25 18:19:20,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 180 transitions, 2137 flow [2022-11-25 18:19:20,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 180 transitions, 2004 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-11-25 18:19:20,295 INFO L231 Difference]: Finished difference. Result has 75 places, 111 transitions, 1453 flow [2022-11-25 18:19:20,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1453, PETRI_PLACES=75, PETRI_TRANSITIONS=111} [2022-11-25 18:19:20,297 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2022-11-25 18:19:20,298 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 111 transitions, 1453 flow [2022-11-25 18:19:20,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:20,299 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:20,299 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:20,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:19:20,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1805347284, now seen corresponding path program 4 times [2022-11-25 18:19:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352265087] [2022-11-25 18:19:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:20,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:20,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352265087] [2022-11-25 18:19:20,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352265087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:20,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:20,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:19:20,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332097683] [2022-11-25 18:19:20,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:20,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:19:20,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:20,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:19:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:19:20,799 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2022-11-25 18:19:20,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 111 transitions, 1453 flow. Second operand has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:20,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:20,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2022-11-25 18:19:20,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:21,647 INFO L130 PetriNetUnfolder]: 1989/3106 cut-off events. [2022-11-25 18:19:21,647 INFO L131 PetriNetUnfolder]: For 35437/35627 co-relation queries the response was YES. [2022-11-25 18:19:21,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19688 conditions, 3106 events. 1989/3106 cut-off events. For 35437/35627 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15780 event pairs, 326 based on Foata normal form. 165/3261 useless extension candidates. Maximal degree in co-relation 19651. Up to 1698 conditions per place. [2022-11-25 18:19:21,682 INFO L137 encePairwiseOnDemand]: 214/222 looper letters, 75 selfloop transitions, 61 changer transitions 13/158 dead transitions. [2022-11-25 18:19:21,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 158 transitions, 2179 flow [2022-11-25 18:19:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:19:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:19:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 888 transitions. [2022-11-25 18:19:21,685 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 18:19:21,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 888 transitions. [2022-11-25 18:19:21,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 888 transitions. [2022-11-25 18:19:21,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:21,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 888 transitions. [2022-11-25 18:19:21,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:21,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:21,692 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 222.0) internal successors, (1998), 9 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:21,692 INFO L175 Difference]: Start difference. First operand has 75 places, 111 transitions, 1453 flow. Second operand 8 states and 888 transitions. [2022-11-25 18:19:21,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 158 transitions, 2179 flow [2022-11-25 18:19:21,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 158 transitions, 2026 flow, removed 58 selfloop flow, removed 5 redundant places. [2022-11-25 18:19:21,781 INFO L231 Difference]: Finished difference. Result has 78 places, 114 transitions, 1580 flow [2022-11-25 18:19:21,781 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1580, PETRI_PLACES=78, PETRI_TRANSITIONS=114} [2022-11-25 18:19:21,782 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2022-11-25 18:19:21,782 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 114 transitions, 1580 flow [2022-11-25 18:19:21,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:21,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:21,783 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:21,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:19:21,783 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 450634210, now seen corresponding path program 1 times [2022-11-25 18:19:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:21,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496476158] [2022-11-25 18:19:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:21,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:22,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-11-25 18:19:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:22,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496476158] [2022-11-25 18:19:22,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496476158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:22,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:22,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:19:22,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822135186] [2022-11-25 18:19:22,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:22,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:22,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2022-11-25 18:19:22,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 114 transitions, 1580 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:22,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:22,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2022-11-25 18:19:22,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:23,564 INFO L130 PetriNetUnfolder]: 2827/4274 cut-off events. [2022-11-25 18:19:23,564 INFO L131 PetriNetUnfolder]: For 55747/56055 co-relation queries the response was YES. [2022-11-25 18:19:23,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27930 conditions, 4274 events. 2827/4274 cut-off events. For 55747/56055 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22212 event pairs, 244 based on Foata normal form. 283/4540 useless extension candidates. Maximal degree in co-relation 27892. Up to 2150 conditions per place. [2022-11-25 18:19:23,598 INFO L137 encePairwiseOnDemand]: 213/222 looper letters, 163 selfloop transitions, 19 changer transitions 55/243 dead transitions. [2022-11-25 18:19:23,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 243 transitions, 3840 flow [2022-11-25 18:19:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 720 transitions. [2022-11-25 18:19:23,602 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46332046332046334 [2022-11-25 18:19:23,602 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 720 transitions. [2022-11-25 18:19:23,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 720 transitions. [2022-11-25 18:19:23,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:23,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 720 transitions. [2022-11-25 18:19:23,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:23,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:23,608 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:23,609 INFO L175 Difference]: Start difference. First operand has 78 places, 114 transitions, 1580 flow. Second operand 7 states and 720 transitions. [2022-11-25 18:19:23,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 243 transitions, 3840 flow [2022-11-25 18:19:23,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 243 transitions, 3715 flow, removed 48 selfloop flow, removed 5 redundant places. [2022-11-25 18:19:23,698 INFO L231 Difference]: Finished difference. Result has 82 places, 130 transitions, 1833 flow [2022-11-25 18:19:23,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1833, PETRI_PLACES=82, PETRI_TRANSITIONS=130} [2022-11-25 18:19:23,699 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2022-11-25 18:19:23,700 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 130 transitions, 1833 flow [2022-11-25 18:19:23,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:23,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:23,700 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:23,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:19:23,701 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -294173662, now seen corresponding path program 2 times [2022-11-25 18:19:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:23,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768605360] [2022-11-25 18:19:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:23,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:23,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768605360] [2022-11-25 18:19:23,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768605360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:23,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:23,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:19:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770874992] [2022-11-25 18:19:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:23,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:19:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:19:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:19:23,887 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2022-11-25 18:19:23,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 130 transitions, 1833 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:23,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:23,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2022-11-25 18:19:23,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:24,523 INFO L130 PetriNetUnfolder]: 1635/2694 cut-off events. [2022-11-25 18:19:24,523 INFO L131 PetriNetUnfolder]: For 47238/47844 co-relation queries the response was YES. [2022-11-25 18:19:24,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17823 conditions, 2694 events. 1635/2694 cut-off events. For 47238/47844 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15677 event pairs, 257 based on Foata normal form. 655/3284 useless extension candidates. Maximal degree in co-relation 17782. Up to 1441 conditions per place. [2022-11-25 18:19:24,545 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 120 selfloop transitions, 6 changer transitions 84/228 dead transitions. [2022-11-25 18:19:24,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 228 transitions, 3592 flow [2022-11-25 18:19:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:19:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:19:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-11-25 18:19:24,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5063063063063064 [2022-11-25 18:19:24,548 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2022-11-25 18:19:24,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2022-11-25 18:19:24,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:24,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2022-11-25 18:19:24,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:24,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:24,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:24,553 INFO L175 Difference]: Start difference. First operand has 82 places, 130 transitions, 1833 flow. Second operand 5 states and 562 transitions. [2022-11-25 18:19:24,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 228 transitions, 3592 flow [2022-11-25 18:19:24,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 228 transitions, 3574 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-11-25 18:19:24,607 INFO L231 Difference]: Finished difference. Result has 87 places, 102 transitions, 1368 flow [2022-11-25 18:19:24,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1368, PETRI_PLACES=87, PETRI_TRANSITIONS=102} [2022-11-25 18:19:24,608 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2022-11-25 18:19:24,608 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 102 transitions, 1368 flow [2022-11-25 18:19:24,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:24,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:24,609 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:24,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:19:24,609 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1468323190, now seen corresponding path program 1 times [2022-11-25 18:19:24,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:24,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598995039] [2022-11-25 18:19:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:24,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:24,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598995039] [2022-11-25 18:19:24,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598995039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:24,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914966701] [2022-11-25 18:19:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:24,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:19:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:19:24,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:19:24,802 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2022-11-25 18:19:24,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 102 transitions, 1368 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:24,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:24,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2022-11-25 18:19:24,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:25,262 INFO L130 PetriNetUnfolder]: 1000/1736 cut-off events. [2022-11-25 18:19:25,262 INFO L131 PetriNetUnfolder]: For 31186/31619 co-relation queries the response was YES. [2022-11-25 18:19:25,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 1736 events. 1000/1736 cut-off events. For 31186/31619 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9964 event pairs, 89 based on Foata normal form. 396/2102 useless extension candidates. Maximal degree in co-relation 11935. Up to 648 conditions per place. [2022-11-25 18:19:25,273 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 119 selfloop transitions, 10 changer transitions 89/236 dead transitions. [2022-11-25 18:19:25,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 236 transitions, 3694 flow [2022-11-25 18:19:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:19:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:19:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2022-11-25 18:19:25,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5051480051480052 [2022-11-25 18:19:25,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2022-11-25 18:19:25,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2022-11-25 18:19:25,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:25,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2022-11-25 18:19:25,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:25,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:25,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:25,282 INFO L175 Difference]: Start difference. First operand has 87 places, 102 transitions, 1368 flow. Second operand 7 states and 785 transitions. [2022-11-25 18:19:25,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 236 transitions, 3694 flow [2022-11-25 18:19:25,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 236 transitions, 3438 flow, removed 54 selfloop flow, removed 5 redundant places. [2022-11-25 18:19:25,355 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 1191 flow [2022-11-25 18:19:25,356 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1191, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2022-11-25 18:19:25,357 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2022-11-25 18:19:25,357 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 1191 flow [2022-11-25 18:19:25,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:25,358 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:25,358 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-11-25 18:19:25,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:19:25,358 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:25,359 INFO L85 PathProgramCache]: Analyzing trace with hash 552334845, now seen corresponding path program 1 times [2022-11-25 18:19:25,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:25,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432837094] [2022-11-25 18:19:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:25,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:25,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432837094] [2022-11-25 18:19:25,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432837094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:25,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:25,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:19:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697060650] [2022-11-25 18:19:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:25,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:19:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:19:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:19:25,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2022-11-25 18:19:25,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 1191 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:25,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:25,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2022-11-25 18:19:25,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:26,081 INFO L130 PetriNetUnfolder]: 895/1529 cut-off events. [2022-11-25 18:19:26,081 INFO L131 PetriNetUnfolder]: For 21880/22236 co-relation queries the response was YES. [2022-11-25 18:19:26,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10704 conditions, 1529 events. 895/1529 cut-off events. For 21880/22236 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8711 event pairs, 76 based on Foata normal form. 221/1720 useless extension candidates. Maximal degree in co-relation 10657. Up to 570 conditions per place. [2022-11-25 18:19:26,093 INFO L137 encePairwiseOnDemand]: 216/222 looper letters, 66 selfloop transitions, 11 changer transitions 146/232 dead transitions. [2022-11-25 18:19:26,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 232 transitions, 3451 flow [2022-11-25 18:19:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:19:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 18:19:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 985 transitions. [2022-11-25 18:19:26,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.492992992992993 [2022-11-25 18:19:26,103 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 985 transitions. [2022-11-25 18:19:26,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 985 transitions. [2022-11-25 18:19:26,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:26,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 985 transitions. [2022-11-25 18:19:26,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.44444444444444) internal successors, (985), 9 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,119 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,120 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 1191 flow. Second operand 9 states and 985 transitions. [2022-11-25 18:19:26,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 232 transitions, 3451 flow [2022-11-25 18:19:26,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 232 transitions, 3240 flow, removed 84 selfloop flow, removed 6 redundant places. [2022-11-25 18:19:26,179 INFO L231 Difference]: Finished difference. Result has 95 places, 57 transitions, 655 flow [2022-11-25 18:19:26,180 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=655, PETRI_PLACES=95, PETRI_TRANSITIONS=57} [2022-11-25 18:19:26,181 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2022-11-25 18:19:26,182 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 57 transitions, 655 flow [2022-11-25 18:19:26,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,182 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:26,182 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-11-25 18:19:26,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:19:26,183 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 75726111, now seen corresponding path program 1 times [2022-11-25 18:19:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:26,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429277528] [2022-11-25 18:19:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:26,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429277528] [2022-11-25 18:19:26,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429277528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:19:26,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:19:26,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:19:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647429317] [2022-11-25 18:19:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:19:26,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:19:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:19:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:19:26,468 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 222 [2022-11-25 18:19:26,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 57 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:19:26,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 222 [2022-11-25 18:19:26,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:19:26,729 INFO L130 PetriNetUnfolder]: 436/792 cut-off events. [2022-11-25 18:19:26,729 INFO L131 PetriNetUnfolder]: For 7810/7838 co-relation queries the response was YES. [2022-11-25 18:19:26,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5303 conditions, 792 events. 436/792 cut-off events. For 7810/7838 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3679 event pairs, 72 based on Foata normal form. 21/808 useless extension candidates. Maximal degree in co-relation 5261. Up to 473 conditions per place. [2022-11-25 18:19:26,733 INFO L137 encePairwiseOnDemand]: 218/222 looper letters, 41 selfloop transitions, 1 changer transitions 55/100 dead transitions. [2022-11-25 18:19:26,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 1295 flow [2022-11-25 18:19:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:19:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:19:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2022-11-25 18:19:26,735 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2022-11-25 18:19:26,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2022-11-25 18:19:26,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2022-11-25 18:19:26,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:19:26,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2022-11-25 18:19:26,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,740 INFO L175 Difference]: Start difference. First operand has 95 places, 57 transitions, 655 flow. Second operand 5 states and 549 transitions. [2022-11-25 18:19:26,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 1295 flow [2022-11-25 18:19:26,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 1040 flow, removed 85 selfloop flow, removed 20 redundant places. [2022-11-25 18:19:26,758 INFO L231 Difference]: Finished difference. Result has 74 places, 37 transitions, 284 flow [2022-11-25 18:19:26,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=74, PETRI_TRANSITIONS=37} [2022-11-25 18:19:26,758 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2022-11-25 18:19:26,759 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 37 transitions, 284 flow [2022-11-25 18:19:26,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:19:26,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:19:26,759 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-11-25 18:19:26,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:19:26,760 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:19:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 184214437, now seen corresponding path program 2 times [2022-11-25 18:19:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:26,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590927464] [2022-11-25 18:19:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:19:26,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:19:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:19:26,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:19:26,871 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:19:26,872 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 18:19:26,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 18:19:26,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 18:19:26,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 18:19:26,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 18:19:26,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 18:19:26,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:19:26,875 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 18:19:26,881 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:19:26,882 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:19:26,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:19:26 BasicIcfg [2022-11-25 18:19:26,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:19:26,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:19:26,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:19:26,971 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:19:26,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:00" (3/4) ... [2022-11-25 18:19:26,973 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:19:27,088 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:19:27,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:19:27,089 INFO L158 Benchmark]: Toolchain (without parser) took 27910.76ms. Allocated memory was 205.5MB in the beginning and 530.6MB in the end (delta: 325.1MB). Free memory was 175.0MB in the beginning and 371.1MB in the end (delta: -196.0MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,092 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 130.0MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:19:27,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.04ms. Allocated memory is still 205.5MB. Free memory was 175.0MB in the beginning and 148.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.53ms. Allocated memory is still 205.5MB. Free memory was 148.1MB in the beginning and 145.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,093 INFO L158 Benchmark]: Boogie Preprocessor took 29.85ms. Allocated memory is still 205.5MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,093 INFO L158 Benchmark]: RCFGBuilder took 891.52ms. Allocated memory is still 205.5MB. Free memory was 142.9MB in the beginning and 107.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,094 INFO L158 Benchmark]: TraceAbstraction took 26156.83ms. Allocated memory was 205.5MB in the beginning and 530.6MB in the end (delta: 325.1MB). Free memory was 106.2MB in the beginning and 382.6MB in the end (delta: -276.4MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,094 INFO L158 Benchmark]: Witness Printer took 118.17ms. Allocated memory is still 530.6MB. Free memory was 382.6MB in the beginning and 371.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:19:27,096 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.22ms. Allocated memory is still 130.0MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.04ms. Allocated memory is still 205.5MB. Free memory was 175.0MB in the beginning and 148.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.53ms. Allocated memory is still 205.5MB. Free memory was 148.1MB in the beginning and 145.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.85ms. Allocated memory is still 205.5MB. Free memory was 145.0MB in the beginning and 142.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 891.52ms. Allocated memory is still 205.5MB. Free memory was 142.9MB in the beginning and 107.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26156.83ms. Allocated memory was 205.5MB in the beginning and 530.6MB in the end (delta: 325.1MB). Free memory was 106.2MB in the beginning and 382.6MB in the end (delta: -276.4MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Witness Printer took 118.17ms. Allocated memory is still 530.6MB. Free memory was 382.6MB in the beginning and 371.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 124 PlacesBefore, 35 PlacesAfterwards, 116 TransitionsBefore, 26 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5963 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2575, independent: 2391, independent conditional: 0, independent unconditional: 2391, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1577, independent: 1527, independent conditional: 0, independent unconditional: 1527, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1577, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 519, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 495, dependent conditional: 0, dependent unconditional: 495, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2575, independent: 864, independent conditional: 0, independent unconditional: 864, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 1577, unknown conditional: 0, unknown unconditional: 1577] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 833]: 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: 835]: 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: 831]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 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: 25.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1083 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 573 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2512 IncrementalHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 80 mSDtfsCounter, 2512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1833occurred in iteration=12, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 18:19:27,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f1d2fe-5310-4313-bfc1-21a1181c7dae/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE