./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:57:40,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:57:40,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:57:40,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:57:40,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:57:40,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:57:40,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:57:40,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:57:40,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:57:40,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:57:40,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:57:40,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:57:40,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:57:40,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:57:40,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:57:40,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:57:40,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:57:40,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:57:40,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:57:40,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:57:40,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:57:40,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:57:40,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:57:40,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:57:40,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:57:40,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:57:40,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:57:40,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:57:40,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:57:40,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:57:40,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:57:40,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:57:40,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:57:40,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:57:40,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:57:40,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:57:40,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:57:40,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:57:40,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:57:40,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:57:40,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:57:40,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:57:40,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:57:40,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:57:40,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:57:40,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:57:40,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:57:40,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:57:40,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:57:40,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:57:40,769 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:57:40,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:57:40,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:57:40,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:57:40,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:57:40,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:57:40,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:57:40,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:57:40,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:57:40,776 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:57:40,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:57:40,776 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:57:40,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:57:40,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:57:40,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:57:40,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:57:40,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:57:40,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:57:40,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:57:40,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:57:40,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:57:40,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:57:40,778 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:57:40,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:57:40,779 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:57:40,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:57:40,779 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:57:40,779 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_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f758b611596923134c7292307712c4e6636a1a24449562e0f1ec6ef2697b141 [2022-12-13 16:57:40,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:57:40,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:57:40,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:57:40,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:57:40,964 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:57:40,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:57:43,550 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:57:43,761 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:57:43,762 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/sv-benchmarks/c/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:57:43,773 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/data/de7ce2ed7/9abd89a0b3f2464caee84d369d60a062/FLAG1cf8921bc [2022-12-13 16:57:44,102 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/data/de7ce2ed7/9abd89a0b3f2464caee84d369d60a062 [2022-12-13 16:57:44,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:57:44,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:57:44,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:57:44,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:57:44,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:57:44,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b4c9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44, skipping insertion in model container [2022-12-13 16:57:44,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:57:44,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:57:44,275 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_44cecb7d-61a5-4da8-8440-5ebc5fdca542/sv-benchmarks/c/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-13 16:57:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:57:44,414 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:57:44,422 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_44cecb7d-61a5-4da8-8440-5ebc5fdca542/sv-benchmarks/c/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i[966,979] [2022-12-13 16:57:44,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:44,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:44,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:57:44,499 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:57:44,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44 WrapperNode [2022-12-13 16:57:44,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:57:44,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:57:44,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:57:44,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:57:44,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,537 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 16:57:44,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:57:44,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:57:44,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:57:44,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:57:44,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,556 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:57:44,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:57:44,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:57:44,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:57:44,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (1/1) ... [2022-12-13 16:57:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:57:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:44,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:57:44,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:57:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:57:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:57:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:57:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:57:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:57:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:57:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:57:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:57:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 16:57:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 16:57:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:57:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:57:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:57:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:57:44,621 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:57:44,718 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:57:44,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:57:44,964 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:57:45,039 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:57:45,039 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:57:45,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:45 BoogieIcfgContainer [2022-12-13 16:57:45,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:57:45,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:57:45,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:57:45,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:57:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:57:44" (1/3) ... [2022-12-13 16:57:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36599291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:57:45, skipping insertion in model container [2022-12-13 16:57:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:44" (2/3) ... [2022-12-13 16:57:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36599291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:57:45, skipping insertion in model container [2022-12-13 16:57:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:45" (3/3) ... [2022-12-13 16:57:45,057 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.opt_pso.opt_rmo.opt.i [2022-12-13 16:57:45,063 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 16:57:45,071 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:57:45,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:57:45,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:57:45,129 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:57:45,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-12-13 16:57:45,199 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-13 16:57:45,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:57:45,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 16:57:45,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 290 flow [2022-12-13 16:57:45,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2022-12-13 16:57:45,210 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:57:45,217 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow [2022-12-13 16:57:45,219 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow [2022-12-13 16:57:45,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow [2022-12-13 16:57:45,243 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-13 16:57:45,243 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:57:45,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 16:57:45,245 INFO L119 LiptonReduction]: Number of co-enabled transitions 3076 [2022-12-13 16:57:47,959 INFO L134 LiptonReduction]: Checked pairs total: 8218 [2022-12-13 16:57:47,959 INFO L136 LiptonReduction]: Total number of compositions: 113 [2022-12-13 16:57:47,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:57:47,974 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;@3ea7240e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:57:47,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 16:57:47,977 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 16:57:47,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:57:47,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:47,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:47,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1426721367, now seen corresponding path program 1 times [2022-12-13 16:57:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:47,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142759021] [2022-12-13 16:57:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:48,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142759021] [2022-12-13 16:57:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142759021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:48,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:48,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:57:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315595957] [2022-12-13 16:57:48,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:57:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:57:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:57:48,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2022-12-13 16:57:48,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:48,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:48,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2022-12-13 16:57:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:48,922 INFO L130 PetriNetUnfolder]: 3975/5879 cut-off events. [2022-12-13 16:57:48,923 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 16:57:48,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11459 conditions, 5879 events. 3975/5879 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 33902 event pairs, 753 based on Foata normal form. 192/5650 useless extension candidates. Maximal degree in co-relation 11447. Up to 4303 conditions per place. [2022-12-13 16:57:48,948 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 35 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2022-12-13 16:57:48,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 187 flow [2022-12-13 16:57:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:57:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:57:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2022-12-13 16:57:48,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5470430107526881 [2022-12-13 16:57:48,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2022-12-13 16:57:48,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2022-12-13 16:57:48,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:48,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2022-12-13 16:57:48,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:48,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:48,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:48,979 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 407 transitions. [2022-12-13 16:57:48,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 187 flow [2022-12-13 16:57:48,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:57:48,983 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2022-12-13 16:57:48,985 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-13 16:57:48,988 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-13 16:57:48,989 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2022-12-13 16:57:48,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:48,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:48,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:48,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:57:48,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1751939497, now seen corresponding path program 1 times [2022-12-13 16:57:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:48,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80083273] [2022-12-13 16:57:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80083273] [2022-12-13 16:57:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80083273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:49,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:57:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623738595] [2022-12-13 16:57:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:49,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:49,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:49,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-12-13 16:57:49,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:49,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:49,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-12-13 16:57:49,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:50,854 INFO L130 PetriNetUnfolder]: 14475/19832 cut-off events. [2022-12-13 16:57:50,854 INFO L131 PetriNetUnfolder]: For 878/878 co-relation queries the response was YES. [2022-12-13 16:57:50,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40866 conditions, 19832 events. 14475/19832 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 105593 event pairs, 4259 based on Foata normal form. 848/20680 useless extension candidates. Maximal degree in co-relation 40856. Up to 10319 conditions per place. [2022-12-13 16:57:50,950 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 41 selfloop transitions, 8 changer transitions 31/80 dead transitions. [2022-12-13 16:57:50,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 342 flow [2022-12-13 16:57:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2022-12-13 16:57:50,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2022-12-13 16:57:50,954 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2022-12-13 16:57:50,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2022-12-13 16:57:50,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:50,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2022-12-13 16:57:50,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:50,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:50,962 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:50,962 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 632 transitions. [2022-12-13 16:57:50,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 80 transitions, 342 flow [2022-12-13 16:57:50,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:50,968 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 142 flow [2022-12-13 16:57:50,968 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 16:57:50,968 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-13 16:57:50,969 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 142 flow [2022-12-13 16:57:50,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:50,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:50,969 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:50,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:57:50,970 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1524430369, now seen corresponding path program 1 times [2022-12-13 16:57:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:50,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564825259] [2022-12-13 16:57:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:50,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:51,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564825259] [2022-12-13 16:57:51,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564825259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:51,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:51,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:57:51,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223929774] [2022-12-13 16:57:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:51,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:51,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:51,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:51,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-12-13 16:57:51,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:51,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:51,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-12-13 16:57:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:52,642 INFO L130 PetriNetUnfolder]: 12668/17501 cut-off events. [2022-12-13 16:57:52,643 INFO L131 PetriNetUnfolder]: For 14476/14476 co-relation queries the response was YES. [2022-12-13 16:57:52,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49250 conditions, 17501 events. 12668/17501 cut-off events. For 14476/14476 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 91066 event pairs, 2539 based on Foata normal form. 828/18329 useless extension candidates. Maximal degree in co-relation 49236. Up to 6833 conditions per place. [2022-12-13 16:57:52,700 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 53 selfloop transitions, 8 changer transitions 45/106 dead transitions. [2022-12-13 16:57:52,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 106 transitions, 624 flow [2022-12-13 16:57:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:57:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:57:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-12-13 16:57:52,703 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49942396313364057 [2022-12-13 16:57:52,703 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2022-12-13 16:57:52,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2022-12-13 16:57:52,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:52,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2022-12-13 16:57:52,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:52,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:52,708 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:52,708 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 142 flow. Second operand 7 states and 867 transitions. [2022-12-13 16:57:52,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 106 transitions, 624 flow [2022-12-13 16:57:52,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 106 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:52,742 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 198 flow [2022-12-13 16:57:52,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2022-12-13 16:57:52,742 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2022-12-13 16:57:52,742 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 198 flow [2022-12-13 16:57:52,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:52,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:52,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:57:52,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 8458477, now seen corresponding path program 1 times [2022-12-13 16:57:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915835040] [2022-12-13 16:57:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:52,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:52,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915835040] [2022-12-13 16:57:52,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915835040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:52,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:52,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:57:52,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430420267] [2022-12-13 16:57:52,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:52,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:52,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:52,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 248 [2022-12-13 16:57:52,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:52,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:52,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 248 [2022-12-13 16:57:52,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:54,153 INFO L130 PetriNetUnfolder]: 9326/13569 cut-off events. [2022-12-13 16:57:54,153 INFO L131 PetriNetUnfolder]: For 25837/26107 co-relation queries the response was YES. [2022-12-13 16:57:54,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40664 conditions, 13569 events. 9326/13569 cut-off events. For 25837/26107 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 78866 event pairs, 3233 based on Foata normal form. 737/14148 useless extension candidates. Maximal degree in co-relation 40644. Up to 10430 conditions per place. [2022-12-13 16:57:54,214 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 45 selfloop transitions, 7 changer transitions 25/84 dead transitions. [2022-12-13 16:57:54,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 538 flow [2022-12-13 16:57:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-12-13 16:57:54,217 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5266129032258065 [2022-12-13 16:57:54,217 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2022-12-13 16:57:54,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2022-12-13 16:57:54,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:54,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2022-12-13 16:57:54,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:54,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:54,221 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:54,222 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 198 flow. Second operand 5 states and 653 transitions. [2022-12-13 16:57:54,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 538 flow [2022-12-13 16:57:54,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 529 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:54,350 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 280 flow [2022-12-13 16:57:54,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-13 16:57:54,351 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2022-12-13 16:57:54,351 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 280 flow [2022-12-13 16:57:54,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:54,352 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:54,352 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:57:54,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 393340385, now seen corresponding path program 1 times [2022-12-13 16:57:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:54,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331407813] [2022-12-13 16:57:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:54,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331407813] [2022-12-13 16:57:54,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331407813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:54,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:54,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:57:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427395314] [2022-12-13 16:57:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:54,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:54,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2022-12-13 16:57:54,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:54,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:54,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2022-12-13 16:57:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:55,554 INFO L130 PetriNetUnfolder]: 6646/9804 cut-off events. [2022-12-13 16:57:55,554 INFO L131 PetriNetUnfolder]: For 17746/18462 co-relation queries the response was YES. [2022-12-13 16:57:55,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29550 conditions, 9804 events. 6646/9804 cut-off events. For 17746/18462 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 58497 event pairs, 1294 based on Foata normal form. 826/10264 useless extension candidates. Maximal degree in co-relation 29527. Up to 6518 conditions per place. [2022-12-13 16:57:55,595 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 85 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2022-12-13 16:57:55,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 108 transitions, 823 flow [2022-12-13 16:57:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2022-12-13 16:57:55,599 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2022-12-13 16:57:55,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2022-12-13 16:57:55,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2022-12-13 16:57:55,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:55,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2022-12-13 16:57:55,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:55,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:55,602 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:55,603 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 280 flow. Second operand 5 states and 630 transitions. [2022-12-13 16:57:55,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 108 transitions, 823 flow [2022-12-13 16:57:55,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 775 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-13 16:57:55,624 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 334 flow [2022-12-13 16:57:55,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-12-13 16:57:55,624 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2022-12-13 16:57:55,624 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 334 flow [2022-12-13 16:57:55,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:55,625 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:55,625 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:55,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:57:55,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -455977139, now seen corresponding path program 1 times [2022-12-13 16:57:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320204611] [2022-12-13 16:57:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:55,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320204611] [2022-12-13 16:57:55,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320204611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:55,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:55,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:57:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723652706] [2022-12-13 16:57:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:55,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:55,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:55,750 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-12-13 16:57:55,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 334 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:55,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:55,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-12-13 16:57:55,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:57,385 INFO L130 PetriNetUnfolder]: 11716/17007 cut-off events. [2022-12-13 16:57:57,385 INFO L131 PetriNetUnfolder]: For 35979/35979 co-relation queries the response was YES. [2022-12-13 16:57:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65241 conditions, 17007 events. 11716/17007 cut-off events. For 35979/35979 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 99880 event pairs, 2756 based on Foata normal form. 322/17329 useless extension candidates. Maximal degree in co-relation 65217. Up to 6675 conditions per place. [2022-12-13 16:57:57,439 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 77 selfloop transitions, 18 changer transitions 52/147 dead transitions. [2022-12-13 16:57:57,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 147 transitions, 1126 flow [2022-12-13 16:57:57,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:57:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:57:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2022-12-13 16:57:57,441 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034562211981567 [2022-12-13 16:57:57,441 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2022-12-13 16:57:57,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2022-12-13 16:57:57,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:57,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2022-12-13 16:57:57,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:57,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:57,446 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:57,446 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 334 flow. Second operand 7 states and 874 transitions. [2022-12-13 16:57:57,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 147 transitions, 1126 flow [2022-12-13 16:57:57,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 147 transitions, 1105 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 16:57:57,503 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 426 flow [2022-12-13 16:57:57,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2022-12-13 16:57:57,503 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2022-12-13 16:57:57,503 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 426 flow [2022-12-13 16:57:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:57,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:57,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:57,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:57:57,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1235749978, now seen corresponding path program 1 times [2022-12-13 16:57:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:57,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281494457] [2022-12-13 16:57:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:57,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281494457] [2022-12-13 16:57:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281494457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:57,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:57:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507725632] [2022-12-13 16:57:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:57,636 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2022-12-13 16:57:57,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 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-12-13 16:57:57,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:57,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2022-12-13 16:57:57,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:58,645 INFO L130 PetriNetUnfolder]: 4222/6681 cut-off events. [2022-12-13 16:57:58,645 INFO L131 PetriNetUnfolder]: For 18158/18670 co-relation queries the response was YES. [2022-12-13 16:57:58,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25226 conditions, 6681 events. 4222/6681 cut-off events. For 18158/18670 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 41911 event pairs, 575 based on Foata normal form. 718/7214 useless extension candidates. Maximal degree in co-relation 25195. Up to 2761 conditions per place. [2022-12-13 16:57:58,676 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 104 selfloop transitions, 14 changer transitions 8/142 dead transitions. [2022-12-13 16:57:58,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 142 transitions, 1320 flow [2022-12-13 16:57:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:57:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:57:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2022-12-13 16:57:58,678 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5094086021505376 [2022-12-13 16:57:58,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 758 transitions. [2022-12-13 16:57:58,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions. [2022-12-13 16:57:58,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:58,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions. [2022-12-13 16:57:58,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:58,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:58,683 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:58,683 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 426 flow. Second operand 6 states and 758 transitions. [2022-12-13 16:57:58,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 142 transitions, 1320 flow [2022-12-13 16:57:58,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 142 transitions, 1284 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:58,745 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 534 flow [2022-12-13 16:57:58,746 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2022-12-13 16:57:58,746 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2022-12-13 16:57:58,746 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 534 flow [2022-12-13 16:57:58,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 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-12-13 16:57:58,747 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:58,747 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:58,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:57:58,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:57:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2000781336, now seen corresponding path program 1 times [2022-12-13 16:57:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:58,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118340990] [2022-12-13 16:57:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118340990] [2022-12-13 16:57:58,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118340990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:58,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:58,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:57:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327049663] [2022-12-13 16:57:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:58,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:57:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:57:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:57:58,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2022-12-13 16:57:58,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:58,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:58,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2022-12-13 16:57:58,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:59,893 INFO L130 PetriNetUnfolder]: 3551/5671 cut-off events. [2022-12-13 16:57:59,893 INFO L131 PetriNetUnfolder]: For 16630/17162 co-relation queries the response was YES. [2022-12-13 16:57:59,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24761 conditions, 5671 events. 3551/5671 cut-off events. For 16630/17162 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 35629 event pairs, 357 based on Foata normal form. 402/5921 useless extension candidates. Maximal degree in co-relation 24727. Up to 2396 conditions per place. [2022-12-13 16:57:59,915 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 114 selfloop transitions, 23 changer transitions 24/177 dead transitions. [2022-12-13 16:57:59,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 177 transitions, 1690 flow [2022-12-13 16:57:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:57:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:57:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2022-12-13 16:57:59,918 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5085685483870968 [2022-12-13 16:57:59,918 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2022-12-13 16:57:59,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2022-12-13 16:57:59,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:59,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2022-12-13 16:57:59,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:59,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:59,922 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:59,922 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 534 flow. Second operand 8 states and 1009 transitions. [2022-12-13 16:57:59,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 177 transitions, 1690 flow [2022-12-13 16:58:00,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 177 transitions, 1640 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-13 16:58:00,179 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 652 flow [2022-12-13 16:58:00,179 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=652, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2022-12-13 16:58:00,179 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2022-12-13 16:58:00,180 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 652 flow [2022-12-13 16:58:00,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:00,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:58:00,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:00,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:58:00,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:58:00,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:58:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2084654033, now seen corresponding path program 1 times [2022-12-13 16:58:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:58:00,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938039962] [2022-12-13 16:58:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:58:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:58:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:58:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:58:00,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:58:00,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938039962] [2022-12-13 16:58:00,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938039962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:58:00,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:58:00,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:58:00,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274493281] [2022-12-13 16:58:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:58:00,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:58:00,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:58:00,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:58:00,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:58:00,319 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2022-12-13 16:58:00,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 652 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:00,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:58:00,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2022-12-13 16:58:00,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:58:01,302 INFO L130 PetriNetUnfolder]: 5601/8645 cut-off events. [2022-12-13 16:58:01,302 INFO L131 PetriNetUnfolder]: For 42908/42908 co-relation queries the response was YES. [2022-12-13 16:58:01,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41443 conditions, 8645 events. 5601/8645 cut-off events. For 42908/42908 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 51373 event pairs, 697 based on Foata normal form. 18/8663 useless extension candidates. Maximal degree in co-relation 41407. Up to 4298 conditions per place. [2022-12-13 16:58:01,330 INFO L137 encePairwiseOnDemand]: 237/248 looper letters, 108 selfloop transitions, 33 changer transitions 57/198 dead transitions. [2022-12-13 16:58:01,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 198 transitions, 2132 flow [2022-12-13 16:58:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:58:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:58:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 859 transitions. [2022-12-13 16:58:01,333 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49481566820276496 [2022-12-13 16:58:01,333 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 859 transitions. [2022-12-13 16:58:01,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 859 transitions. [2022-12-13 16:58:01,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:58:01,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 859 transitions. [2022-12-13 16:58:01,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:01,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:01,339 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:01,340 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 652 flow. Second operand 7 states and 859 transitions. [2022-12-13 16:58:01,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 198 transitions, 2132 flow [2022-12-13 16:58:01,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 198 transitions, 1781 flow, removed 143 selfloop flow, removed 6 redundant places. [2022-12-13 16:58:01,936 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 769 flow [2022-12-13 16:58:01,936 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=769, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2022-12-13 16:58:01,937 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2022-12-13 16:58:01,937 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 769 flow [2022-12-13 16:58:01,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:01,937 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:58:01,937 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:01,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:58:01,937 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:58:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:58:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash -426021479, now seen corresponding path program 2 times [2022-12-13 16:58:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:58:01,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344505722] [2022-12-13 16:58:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:58:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:58:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:58:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:58:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:58:02,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344505722] [2022-12-13 16:58:02,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344505722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:58:02,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:58:02,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:58:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110311558] [2022-12-13 16:58:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:58:02,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:58:02,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:58:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:58:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:58:02,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 248 [2022-12-13 16:58:02,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 769 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:02,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:58:02,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 248 [2022-12-13 16:58:02,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:58:02,706 INFO L130 PetriNetUnfolder]: 2919/4888 cut-off events. [2022-12-13 16:58:02,706 INFO L131 PetriNetUnfolder]: For 21328/21553 co-relation queries the response was YES. [2022-12-13 16:58:02,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21984 conditions, 4888 events. 2919/4888 cut-off events. For 21328/21553 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29823 event pairs, 662 based on Foata normal form. 53/4860 useless extension candidates. Maximal degree in co-relation 21945. Up to 2156 conditions per place. [2022-12-13 16:58:02,728 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 77 selfloop transitions, 3 changer transitions 41/136 dead transitions. [2022-12-13 16:58:02,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 136 transitions, 1416 flow [2022-12-13 16:58:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:58:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:58:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2022-12-13 16:58:02,729 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-13 16:58:02,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2022-12-13 16:58:02,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2022-12-13 16:58:02,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:58:02,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2022-12-13 16:58:02,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:02,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:02,732 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:02,732 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 769 flow. Second operand 5 states and 651 transitions. [2022-12-13 16:58:02,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 136 transitions, 1416 flow [2022-12-13 16:58:02,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 136 transitions, 1378 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 16:58:02,816 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 650 flow [2022-12-13 16:58:02,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=650, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2022-12-13 16:58:02,816 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2022-12-13 16:58:02,817 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 650 flow [2022-12-13 16:58:02,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:02,817 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:58:02,817 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:02,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:58:02,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:58:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:58:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -250867943, now seen corresponding path program 3 times [2022-12-13 16:58:02,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:58:02,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564220353] [2022-12-13 16:58:02,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:58:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:58:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:58:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:58:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:58:02,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564220353] [2022-12-13 16:58:02,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564220353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:58:02,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:58:02,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:58:02,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053337818] [2022-12-13 16:58:02,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:58:02,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:58:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:58:02,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:58:02,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:58:02,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2022-12-13 16:58:02,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 650 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:02,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:58:02,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2022-12-13 16:58:02,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:58:03,413 INFO L130 PetriNetUnfolder]: 1782/2985 cut-off events. [2022-12-13 16:58:03,414 INFO L131 PetriNetUnfolder]: For 11971/12115 co-relation queries the response was YES. [2022-12-13 16:58:03,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12779 conditions, 2985 events. 1782/2985 cut-off events. For 11971/12115 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17472 event pairs, 286 based on Foata normal form. 116/3050 useless extension candidates. Maximal degree in co-relation 12750. Up to 1139 conditions per place. [2022-12-13 16:58:03,423 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 44 selfloop transitions, 17 changer transitions 73/144 dead transitions. [2022-12-13 16:58:03,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 144 transitions, 1572 flow [2022-12-13 16:58:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:58:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:58:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 986 transitions. [2022-12-13 16:58:03,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4969758064516129 [2022-12-13 16:58:03,425 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 986 transitions. [2022-12-13 16:58:03,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 986 transitions. [2022-12-13 16:58:03,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:58:03,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 986 transitions. [2022-12-13 16:58:03,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,428 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,428 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 650 flow. Second operand 8 states and 986 transitions. [2022-12-13 16:58:03,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 144 transitions, 1572 flow [2022-12-13 16:58:03,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 144 transitions, 1492 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 16:58:03,482 INFO L231 Difference]: Finished difference. Result has 76 places, 47 transitions, 391 flow [2022-12-13 16:58:03,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=391, PETRI_PLACES=76, PETRI_TRANSITIONS=47} [2022-12-13 16:58:03,482 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2022-12-13 16:58:03,482 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 47 transitions, 391 flow [2022-12-13 16:58:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:58:03,483 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:03,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:58:03,483 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:58:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:58:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 143337479, now seen corresponding path program 1 times [2022-12-13 16:58:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:58:03,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634835688] [2022-12-13 16:58:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:58:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:58:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:58:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:58:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:58:03,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634835688] [2022-12-13 16:58:03,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634835688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:58:03,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:58:03,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:58:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536571822] [2022-12-13 16:58:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:58:03,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:58:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:58:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:58:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:58:03,628 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-12-13 16:58:03,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 47 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:58:03,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-12-13 16:58:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:58:03,827 INFO L130 PetriNetUnfolder]: 710/1234 cut-off events. [2022-12-13 16:58:03,827 INFO L131 PetriNetUnfolder]: For 5848/5848 co-relation queries the response was YES. [2022-12-13 16:58:03,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 1234 events. 710/1234 cut-off events. For 5848/5848 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5775 event pairs, 169 based on Foata normal form. 1/1235 useless extension candidates. Maximal degree in co-relation 5718. Up to 662 conditions per place. [2022-12-13 16:58:03,832 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 49 selfloop transitions, 5 changer transitions 36/90 dead transitions. [2022-12-13 16:58:03,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 905 flow [2022-12-13 16:58:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:58:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:58:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-12-13 16:58:03,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-12-13 16:58:03,834 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2022-12-13 16:58:03,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2022-12-13 16:58:03,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:58:03,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2022-12-13 16:58:03,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,836 INFO L175 Difference]: Start difference. First operand has 76 places, 47 transitions, 391 flow. Second operand 5 states and 605 transitions. [2022-12-13 16:58:03,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 905 flow [2022-12-13 16:58:03,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 677 flow, removed 41 selfloop flow, removed 17 redundant places. [2022-12-13 16:58:03,848 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 215 flow [2022-12-13 16:58:03,848 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2022-12-13 16:58:03,849 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2022-12-13 16:58:03,849 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 215 flow [2022-12-13 16:58:03,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:03,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:58:03,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:03,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:58:03,849 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:58:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:58:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash 29348001, now seen corresponding path program 2 times [2022-12-13 16:58:03,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:58:03,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217863103] [2022-12-13 16:58:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:58:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:58:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:58:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:58:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:58:04,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217863103] [2022-12-13 16:58:04,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217863103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:58:04,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:58:04,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:58:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435439406] [2022-12-13 16:58:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:58:04,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:58:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:58:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:58:04,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:58:04,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 248 [2022-12-13 16:58:04,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:04,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:58:04,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 248 [2022-12-13 16:58:04,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:58:04,435 INFO L130 PetriNetUnfolder]: 192/360 cut-off events. [2022-12-13 16:58:04,435 INFO L131 PetriNetUnfolder]: For 954/957 co-relation queries the response was YES. [2022-12-13 16:58:04,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 360 events. 192/360 cut-off events. For 954/957 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1380 event pairs, 18 based on Foata normal form. 2/359 useless extension candidates. Maximal degree in co-relation 1289. Up to 124 conditions per place. [2022-12-13 16:58:04,436 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 39 selfloop transitions, 3 changer transitions 37/83 dead transitions. [2022-12-13 16:58:04,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 609 flow [2022-12-13 16:58:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:58:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 16:58:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2022-12-13 16:58:04,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2022-12-13 16:58:04,438 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2022-12-13 16:58:04,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2022-12-13 16:58:04,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:58:04,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2022-12-13 16:58:04,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:04,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:04,441 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:04,441 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 215 flow. Second operand 8 states and 968 transitions. [2022-12-13 16:58:04,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 609 flow [2022-12-13 16:58:04,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 546 flow, removed 9 selfloop flow, removed 12 redundant places. [2022-12-13 16:58:04,444 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 188 flow [2022-12-13 16:58:04,444 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=188, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2022-12-13 16:58:04,445 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-12-13 16:58:04,445 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 188 flow [2022-12-13 16:58:04,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:58:04,445 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:58:04,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:04,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:58:04,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 16:58:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:58:04,446 INFO L85 PathProgramCache]: Analyzing trace with hash -154390015, now seen corresponding path program 3 times [2022-12-13 16:58:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:58:04,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059116611] [2022-12-13 16:58:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:58:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:58:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:58:04,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:58:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:58:04,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:58:04,514 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:58:04,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 16:58:04,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 16:58:04,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 16:58:04,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 16:58:04,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 16:58:04,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 16:58:04,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 16:58:04,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:58:04,518 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:58:04,522 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:58:04,522 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:58:04,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:58:04 BasicIcfg [2022-12-13 16:58:04,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:58:04,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:58:04,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:58:04,572 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:58:04,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:45" (3/4) ... [2022-12-13 16:58:04,574 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:58:04,636 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:58:04,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:58:04,637 INFO L158 Benchmark]: Toolchain (without parser) took 20531.79ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 121.3MB in the beginning and 887.7MB in the end (delta: -766.4MB). Peak memory consumption was 954.4MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,638 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 123.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:58:04,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.45ms. Allocated memory is still 155.2MB. Free memory was 120.8MB in the beginning and 93.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,639 INFO L158 Benchmark]: Boogie Preprocessor took 21.31ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 89.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,639 INFO L158 Benchmark]: RCFGBuilder took 481.66ms. Allocated memory is still 155.2MB. Free memory was 89.4MB in the beginning and 55.8MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,639 INFO L158 Benchmark]: TraceAbstraction took 19528.89ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 55.3MB in the beginning and 903.4MB in the end (delta: -848.1MB). Peak memory consumption was 874.7MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,640 INFO L158 Benchmark]: Witness Printer took 64.52ms. Allocated memory is still 1.9GB. Free memory was 903.4MB in the beginning and 887.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 16:58:04,642 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 123.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.45ms. Allocated memory is still 155.2MB. Free memory was 120.8MB in the beginning and 93.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 91.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.31ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 89.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.66ms. Allocated memory is still 155.2MB. Free memory was 89.4MB in the beginning and 55.8MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19528.89ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 55.3MB in the beginning and 903.4MB in the end (delta: -848.1MB). Peak memory consumption was 874.7MB. Max. memory is 16.1GB. * Witness Printer took 64.52ms. Allocated memory is still 1.9GB. Free memory was 903.4MB in the beginning and 887.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 142 PlacesBefore, 43 PlacesAfterwards, 131 TransitionsBefore, 31 TransitionsAfterwards, 3076 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 8218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3263, independent: 3037, independent conditional: 0, independent unconditional: 3037, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1619, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3263, independent: 1451, independent conditional: 0, independent unconditional: 1451, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 1619, unknown conditional: 0, unknown unconditional: 1619] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t717, ((void *)0), P0, ((void *)0))=-3, t717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t718, ((void *)0), P1, ((void *)0))=-2, t717={5:0}, t718={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t719, ((void *)0), P2, ((void *)0))=-1, t717={5:0}, t718={6:0}, t719={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t720, ((void *)0), P3, ((void *)0))=0, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - 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: 859]: 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: 855]: 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: 857]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 925 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 761 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1945 IncrementalHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 101 mSDtfsCounter, 1945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=769occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 16:58:04,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44cecb7d-61a5-4da8-8440-5ebc5fdca542/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE