./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/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_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/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_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/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 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:39:14,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:39:14,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:39:14,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:39:14,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:39:14,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:39:14,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:39:14,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:39:14,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:39:14,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:39:14,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:39:14,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:39:14,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:39:14,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:39:14,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:39:14,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:39:14,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:39:14,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:39:14,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:39:14,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:39:14,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:39:14,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:39:14,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:39:14,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:39:14,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:39:14,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:39:14,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:39:14,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:39:14,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:39:14,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:39:14,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:39:14,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:39:14,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:39:14,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:39:14,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:39:14,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:39:14,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:39:14,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:39:14,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:39:14,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:39:14,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:39:14,284 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:39:14,298 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:39:14,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:39:14,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:39:14,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:39:14,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:39:14,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:39:14,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:39:14,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:39:14,300 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:39:14,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:39:14,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:39:14,301 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:39:14,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:39:14,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:39:14,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:39:14,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:39:14,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:39:14,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:39:14,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:39:14,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:39:14,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:39:14,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:39:14,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:39:14,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:39:14,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:39:14,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:39:14,304 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:39:14,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:39:14,304 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:39:14,304 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_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/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_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/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 -> 7a9379df521a7077d18fd2276dc35da388f77854d23421e689a681d711c31769 [2022-12-13 21:39:14,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:39:14,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:39:14,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:39:14,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:39:14,512 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:39:14,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i [2022-12-13 21:39:17,063 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:39:17,265 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:39:17,265 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i [2022-12-13 21:39:17,281 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/data/69b1e42f4/8c406ee1b0654c80801b6171f9bc0fe7/FLAGdc48eed43 [2022-12-13 21:39:17,292 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/data/69b1e42f4/8c406ee1b0654c80801b6171f9bc0fe7 [2022-12-13 21:39:17,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:39:17,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:39:17,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:39:17,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:39:17,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:39:17,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d47c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17, skipping insertion in model container [2022-12-13 21:39:17,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:39:17,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:39:17,494 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_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i[995,1008] [2022-12-13 21:39:17,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:39:17,729 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:39:17,740 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_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/sv-benchmarks/c/pthread-wmm/safe002_power.oepc.i[995,1008] [2022-12-13 21:39:17,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:39:17,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:39:17,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:39:17,836 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:39:17,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17 WrapperNode [2022-12-13 21:39:17,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:39:17,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:39:17,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:39:17,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:39:17,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,893 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 167 [2022-12-13 21:39:17,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:39:17,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:39:17,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:39:17,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:39:17,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:39:17,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:39:17,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:39:17,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:39:17,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (1/1) ... [2022-12-13 21:39:17,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:39:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:39:17,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:39:17,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:39:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:39:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:39:18,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:39:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:39:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:39:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:39:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:39:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:39:18,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:39:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:39:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:39:18,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:39:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:39:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:39:18,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:39:18,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:39:18,012 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 21:39:18,142 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:39:18,144 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:39:18,541 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:39:18,822 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:39:18,822 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:39:18,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:39:18 BoogieIcfgContainer [2022-12-13 21:39:18,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:39:18,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:39:18,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:39:18,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:39:18,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:39:17" (1/3) ... [2022-12-13 21:39:18,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d70662a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:39:18, skipping insertion in model container [2022-12-13 21:39:18,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:39:17" (2/3) ... [2022-12-13 21:39:18,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d70662a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:39:18, skipping insertion in model container [2022-12-13 21:39:18,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:39:18" (3/3) ... [2022-12-13 21:39:18,832 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2022-12-13 21:39:18,841 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:39:18,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:39:18,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:39:18,850 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:39:18,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:39:18,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow [2022-12-13 21:39:19,009 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-13 21:39:19,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:39:19,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 21:39:19,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 132 transitions, 279 flow [2022-12-13 21:39:19,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 115 transitions, 239 flow [2022-12-13 21:39:19,023 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:39:19,034 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 115 transitions, 239 flow [2022-12-13 21:39:19,036 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 115 transitions, 239 flow [2022-12-13 21:39:19,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 115 transitions, 239 flow [2022-12-13 21:39:19,065 INFO L130 PetriNetUnfolder]: 1/115 cut-off events. [2022-12-13 21:39:19,065 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:39:19,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 1/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 40 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-13 21:39:19,067 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2022-12-13 21:39:28,660 INFO L134 LiptonReduction]: Checked pairs total: 3565 [2022-12-13 21:39:28,660 INFO L136 LiptonReduction]: Total number of compositions: 99 [2022-12-13 21:39:28,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:39:28,681 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;@5377c187, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:39:28,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 21:39:28,690 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 21:39:28,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:39:28,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:28,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:28,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -488102408, now seen corresponding path program 1 times [2022-12-13 21:39:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:28,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050733344] [2022-12-13 21:39:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:29,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050733344] [2022-12-13 21:39:29,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050733344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:29,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:29,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:39:29,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058334866] [2022-12-13 21:39:29,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:29,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:39:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:39:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:39:29,262 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 231 [2022-12-13 21:39:29,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:29,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:29,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 231 [2022-12-13 21:39:29,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:29,515 INFO L130 PetriNetUnfolder]: 378/629 cut-off events. [2022-12-13 21:39:29,515 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 21:39:29,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 629 events. 378/629 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2763 event pairs, 102 based on Foata normal form. 12/637 useless extension candidates. Maximal degree in co-relation 1244. Up to 445 conditions per place. [2022-12-13 21:39:29,519 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 22 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-13 21:39:29,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 111 flow [2022-12-13 21:39:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:39:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:39:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-12-13 21:39:29,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5512265512265512 [2022-12-13 21:39:29,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-12-13 21:39:29,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-12-13 21:39:29,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:29,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-12-13 21:39:29,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:29,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:29,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:29,545 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 49 flow. Second operand 3 states and 382 transitions. [2022-12-13 21:39:29,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 111 flow [2022-12-13 21:39:29,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:39:29,550 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-13 21:39:29,552 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-13 21:39:29,555 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2022-12-13 21:39:29,556 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-13 21:39:29,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:29,556 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:29,556 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:29,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:39:29,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:29,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2048693621, now seen corresponding path program 1 times [2022-12-13 21:39:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:29,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627126560] [2022-12-13 21:39:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:29,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:29,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627126560] [2022-12-13 21:39:29,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627126560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:29,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:29,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:39:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690672544] [2022-12-13 21:39:29,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:29,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:39:29,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:39:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:39:29,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 231 [2022-12-13 21:39:29,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 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 21:39:29,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:29,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 231 [2022-12-13 21:39:29,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:30,058 INFO L130 PetriNetUnfolder]: 349/573 cut-off events. [2022-12-13 21:39:30,058 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 21:39:30,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 573 events. 349/573 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2353 event pairs, 167 based on Foata normal form. 12/579 useless extension candidates. Maximal degree in co-relation 1243. Up to 427 conditions per place. [2022-12-13 21:39:30,062 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 27 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-13 21:39:30,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 143 flow [2022-12-13 21:39:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:39:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:39:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-12-13 21:39:30,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5627705627705628 [2022-12-13 21:39:30,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-12-13 21:39:30,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-12-13 21:39:30,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:30,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-12-13 21:39:30,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:30,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:30,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:30,070 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 390 transitions. [2022-12-13 21:39:30,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 143 flow [2022-12-13 21:39:30,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:39:30,072 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2022-12-13 21:39:30,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-13 21:39:30,073 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-13 21:39:30,073 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2022-12-13 21:39:30,073 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 21:39:30,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:30,073 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:30,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:39:30,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash -916564955, now seen corresponding path program 1 times [2022-12-13 21:39:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:30,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475491350] [2022-12-13 21:39:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475491350] [2022-12-13 21:39:31,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475491350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:31,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:31,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:39:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834948380] [2022-12-13 21:39:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:39:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:39:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:39:31,566 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 231 [2022-12-13 21:39:31,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:31,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:31,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 231 [2022-12-13 21:39:31,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:32,073 INFO L130 PetriNetUnfolder]: 839/1321 cut-off events. [2022-12-13 21:39:32,073 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2022-12-13 21:39:32,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1321 events. 839/1321 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6487 event pairs, 218 based on Foata normal form. 38/1359 useless extension candidates. Maximal degree in co-relation 3078. Up to 669 conditions per place. [2022-12-13 21:39:32,077 INFO L137 encePairwiseOnDemand]: 222/231 looper letters, 30 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2022-12-13 21:39:32,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 197 flow [2022-12-13 21:39:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:39:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:39:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-12-13 21:39:32,080 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-13 21:39:32,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2022-12-13 21:39:32,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2022-12-13 21:39:32,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:32,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2022-12-13 21:39:32,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:32,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:32,083 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:32,083 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 5 states and 594 transitions. [2022-12-13 21:39:32,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 197 flow [2022-12-13 21:39:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:39:32,084 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 124 flow [2022-12-13 21:39:32,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 21:39:32,085 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-13 21:39:32,085 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 124 flow [2022-12-13 21:39:32,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:32,086 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:32,086 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:32,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:39:32,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1649578398, now seen corresponding path program 1 times [2022-12-13 21:39:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:32,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909770480] [2022-12-13 21:39:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:32,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909770480] [2022-12-13 21:39:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909770480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:32,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:32,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:39:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024712619] [2022-12-13 21:39:32,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:32,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:39:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:39:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:39:32,547 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 231 [2022-12-13 21:39:32,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:32,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:32,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 231 [2022-12-13 21:39:32,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:33,033 INFO L130 PetriNetUnfolder]: 979/1528 cut-off events. [2022-12-13 21:39:33,033 INFO L131 PetriNetUnfolder]: For 930/930 co-relation queries the response was YES. [2022-12-13 21:39:33,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4166 conditions, 1528 events. 979/1528 cut-off events. For 930/930 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7446 event pairs, 208 based on Foata normal form. 30/1557 useless extension candidates. Maximal degree in co-relation 4152. Up to 906 conditions per place. [2022-12-13 21:39:33,037 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 33 selfloop transitions, 4 changer transitions 10/48 dead transitions. [2022-12-13 21:39:33,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 289 flow [2022-12-13 21:39:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:39:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:39:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2022-12-13 21:39:33,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5183982683982684 [2022-12-13 21:39:33,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2022-12-13 21:39:33,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2022-12-13 21:39:33,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:33,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2022-12-13 21:39:33,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,042 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,042 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 124 flow. Second operand 4 states and 479 transitions. [2022-12-13 21:39:33,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 289 flow [2022-12-13 21:39:33,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:39:33,044 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 132 flow [2022-12-13 21:39:33,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-13 21:39:33,045 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-13 21:39:33,045 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 132 flow [2022-12-13 21:39:33,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,045 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:33,045 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:33,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:39:33,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:33,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:33,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2143091138, now seen corresponding path program 1 times [2022-12-13 21:39:33,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:33,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903478041] [2022-12-13 21:39:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:33,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903478041] [2022-12-13 21:39:33,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903478041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:33,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:33,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:39:33,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88605436] [2022-12-13 21:39:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:33,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:39:33,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:33,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:39:33,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:39:33,241 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 231 [2022-12-13 21:39:33,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:33,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 231 [2022-12-13 21:39:33,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:33,541 INFO L130 PetriNetUnfolder]: 344/608 cut-off events. [2022-12-13 21:39:33,541 INFO L131 PetriNetUnfolder]: For 710/718 co-relation queries the response was YES. [2022-12-13 21:39:33,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 608 events. 344/608 cut-off events. For 710/718 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2817 event pairs, 49 based on Foata normal form. 70/675 useless extension candidates. Maximal degree in co-relation 1872. Up to 358 conditions per place. [2022-12-13 21:39:33,547 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 47 selfloop transitions, 7 changer transitions 7/65 dead transitions. [2022-12-13 21:39:33,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 65 transitions, 431 flow [2022-12-13 21:39:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:39:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:39:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2022-12-13 21:39:33,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2022-12-13 21:39:33,551 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2022-12-13 21:39:33,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2022-12-13 21:39:33,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:33,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2022-12-13 21:39:33,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,559 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,559 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 132 flow. Second operand 5 states and 623 transitions. [2022-12-13 21:39:33,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 65 transitions, 431 flow [2022-12-13 21:39:33,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 403 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 21:39:33,564 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 170 flow [2022-12-13 21:39:33,564 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 21:39:33,565 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-13 21:39:33,565 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 170 flow [2022-12-13 21:39:33,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:33,566 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:33,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:39:33,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1150890655, now seen corresponding path program 1 times [2022-12-13 21:39:33,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:33,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860434378] [2022-12-13 21:39:33,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:33,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860434378] [2022-12-13 21:39:33,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860434378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:33,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:33,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:39:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318445387] [2022-12-13 21:39:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:33,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:39:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:39:33,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:39:33,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 231 [2022-12-13 21:39:33,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:33,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:33,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 231 [2022-12-13 21:39:33,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:34,086 INFO L130 PetriNetUnfolder]: 269/506 cut-off events. [2022-12-13 21:39:34,087 INFO L131 PetriNetUnfolder]: For 723/730 co-relation queries the response was YES. [2022-12-13 21:39:34,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 506 events. 269/506 cut-off events. For 723/730 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2355 event pairs, 17 based on Foata normal form. 42/545 useless extension candidates. Maximal degree in co-relation 1836. Up to 178 conditions per place. [2022-12-13 21:39:34,089 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 54 selfloop transitions, 13 changer transitions 12/83 dead transitions. [2022-12-13 21:39:34,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 592 flow [2022-12-13 21:39:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:39:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:39:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2022-12-13 21:39:34,091 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5374149659863946 [2022-12-13 21:39:34,091 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2022-12-13 21:39:34,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2022-12-13 21:39:34,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:34,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2022-12-13 21:39:34,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,095 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,095 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 170 flow. Second operand 7 states and 869 transitions. [2022-12-13 21:39:34,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 592 flow [2022-12-13 21:39:34,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:39:34,097 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 254 flow [2022-12-13 21:39:34,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2022-12-13 21:39:34,098 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-13 21:39:34,098 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 254 flow [2022-12-13 21:39:34,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,098 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:34,099 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:34,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:39:34,099 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash 567832187, now seen corresponding path program 1 times [2022-12-13 21:39:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:34,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422235087] [2022-12-13 21:39:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422235087] [2022-12-13 21:39:34,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422235087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:34,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:34,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:39:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280330444] [2022-12-13 21:39:34,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:34,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:39:34,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:39:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:39:34,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 231 [2022-12-13 21:39:34,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:34,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 231 [2022-12-13 21:39:34,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:34,602 INFO L130 PetriNetUnfolder]: 492/935 cut-off events. [2022-12-13 21:39:34,603 INFO L131 PetriNetUnfolder]: For 2447/2452 co-relation queries the response was YES. [2022-12-13 21:39:34,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3798 conditions, 935 events. 492/935 cut-off events. For 2447/2452 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4972 event pairs, 96 based on Foata normal form. 12/947 useless extension candidates. Maximal degree in co-relation 3776. Up to 504 conditions per place. [2022-12-13 21:39:34,606 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 54 selfloop transitions, 2 changer transitions 13/72 dead transitions. [2022-12-13 21:39:34,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 630 flow [2022-12-13 21:39:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:39:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:39:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2022-12-13 21:39:34,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.54004329004329 [2022-12-13 21:39:34,608 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2022-12-13 21:39:34,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2022-12-13 21:39:34,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:34,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2022-12-13 21:39:34,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,610 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,610 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 254 flow. Second operand 4 states and 499 transitions. [2022-12-13 21:39:34,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 630 flow [2022-12-13 21:39:34,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 565 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 21:39:34,617 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 221 flow [2022-12-13 21:39:34,618 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2022-12-13 21:39:34,618 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2022-12-13 21:39:34,618 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 221 flow [2022-12-13 21:39:34,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,618 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:34,618 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:34,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:39:34,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2100334949, now seen corresponding path program 2 times [2022-12-13 21:39:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:34,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039442288] [2022-12-13 21:39:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:39:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:39:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:39:34,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039442288] [2022-12-13 21:39:34,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039442288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:39:34,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:39:34,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:39:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088479737] [2022-12-13 21:39:34,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:39:34,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:39:34,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:39:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:39:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:39:34,822 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 231 [2022-12-13 21:39:34,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:34,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:39:34,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 231 [2022-12-13 21:39:34,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:39:35,140 INFO L130 PetriNetUnfolder]: 307/602 cut-off events. [2022-12-13 21:39:35,140 INFO L131 PetriNetUnfolder]: For 1109/1119 co-relation queries the response was YES. [2022-12-13 21:39:35,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 602 events. 307/602 cut-off events. For 1109/1119 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3131 event pairs, 21 based on Foata normal form. 31/626 useless extension candidates. Maximal degree in co-relation 2258. Up to 149 conditions per place. [2022-12-13 21:39:35,143 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 44 selfloop transitions, 15 changer transitions 19/82 dead transitions. [2022-12-13 21:39:35,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 622 flow [2022-12-13 21:39:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:39:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 21:39:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2022-12-13 21:39:35,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5276575276575276 [2022-12-13 21:39:35,146 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2022-12-13 21:39:35,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2022-12-13 21:39:35,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:39:35,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2022-12-13 21:39:35,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:35,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:35,154 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:35,154 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 221 flow. Second operand 9 states and 1097 transitions. [2022-12-13 21:39:35,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 622 flow [2022-12-13 21:39:35,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 584 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 21:39:35,159 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 250 flow [2022-12-13 21:39:35,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2022-12-13 21:39:35,160 INFO L288 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-13 21:39:35,160 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 250 flow [2022-12-13 21:39:35,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:39:35,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:39:35,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:39:35,161 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:39:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:39:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1460395863, now seen corresponding path program 1 times [2022-12-13 21:39:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:39:35,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493002950] [2022-12-13 21:39:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:39:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:39:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:39:35,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:39:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:39:35,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:39:35,394 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:39:35,395 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 21:39:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 21:39:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 21:39:35,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 21:39:35,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:39:35,397 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:39:35,403 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:39:35,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:39:35,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:39:35 BasicIcfg [2022-12-13 21:39:35,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:39:35,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:39:35,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:39:35,473 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:39:35,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:39:18" (3/4) ... [2022-12-13 21:39:35,475 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:39:35,557 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:39:35,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:39:35,558 INFO L158 Benchmark]: Toolchain (without parser) took 18262.41ms. Allocated memory was 157.3MB in the beginning and 339.7MB in the end (delta: 182.5MB). Free memory was 112.6MB in the beginning and 228.2MB in the end (delta: -115.6MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2022-12-13 21:39:35,558 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 157.3MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:39:35,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.27ms. Allocated memory is still 157.3MB. Free memory was 112.6MB in the beginning and 83.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 21:39:35,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.92ms. Allocated memory is still 157.3MB. Free memory was 82.8MB in the beginning and 80.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 21:39:35,559 INFO L158 Benchmark]: Boogie Preprocessor took 47.10ms. Allocated memory is still 157.3MB. Free memory was 80.1MB in the beginning and 77.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:39:35,560 INFO L158 Benchmark]: RCFGBuilder took 883.09ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 77.4MB in the beginning and 86.5MB in the end (delta: -9.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2022-12-13 21:39:35,560 INFO L158 Benchmark]: TraceAbstraction took 16645.09ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 85.4MB in the beginning and 244.0MB in the end (delta: -158.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:39:35,560 INFO L158 Benchmark]: Witness Printer took 85.24ms. Allocated memory is still 339.7MB. Free memory was 244.0MB in the beginning and 228.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 21:39:35,562 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.13ms. Allocated memory is still 157.3MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.27ms. Allocated memory is still 157.3MB. Free memory was 112.6MB in the beginning and 83.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.92ms. Allocated memory is still 157.3MB. Free memory was 82.8MB in the beginning and 80.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.10ms. Allocated memory is still 157.3MB. Free memory was 80.1MB in the beginning and 77.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 883.09ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 77.4MB in the beginning and 86.5MB in the end (delta: -9.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16645.09ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 85.4MB in the beginning and 244.0MB in the end (delta: -158.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 85.24ms. Allocated memory is still 339.7MB. Free memory was 244.0MB in the beginning and 228.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 124 PlacesBefore, 30 PlacesAfterwards, 115 TransitionsBefore, 20 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 3565 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1319, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 662, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1319, independent: 512, independent conditional: 0, independent unconditional: 512, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 662, unknown conditional: 0, unknown unconditional: 662] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, 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: 19]: 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_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1825; [L854] FCALL, FORK 0 pthread_create(&t1825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1825, ((void *)0), P0, ((void *)0))=8, t1825={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=0, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L855] 0 pthread_t t1826; [L856] FCALL, FORK 0 pthread_create(&t1826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1826, ((void *)0), P1, ((void *)0))=9, t1825={7:0}, t1826={5:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=0, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=0, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=1, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L857] 0 pthread_t t1827; [L795] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=1, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 \read(y) [L798] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=1, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L858] FCALL, FORK 0 pthread_create(&t1827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1827, ((void *)0), P2, ((void *)0))=10, t1825={7:0}, t1826={5:0}, t1827={6:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=1, x=1, y={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] EXPR 3 \read(y) [L815] 3 y$mem_tmp = y [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] EXPR 3 \read(y) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 \read(y) [L823] 3 __unbuffered_p2_EAX = y [L824] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=4, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L828] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=4, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 \read(y) [L831] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L831] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 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) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 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 [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=4, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 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) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 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 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, t1825={7:0}, t1826={5:0}, t1827={6:0}, weak$$choice0=4, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 \read(y) [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 157 locations, 4 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: 16.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 630 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 24 mSDtfsCounter, 630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=6, InterpolantAutomatonStates: 40, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 653 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 21:39:35,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81d2397-5046-4fa1-b0a6-de301d6f1c9d/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