./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:27:56,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:27:56,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:27:56,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:27:56,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:27:56,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:27:56,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:27:56,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:27:56,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:27:56,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:27:56,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:27:56,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:27:56,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:27:56,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:27:56,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:27:56,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:27:56,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:27:56,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:27:56,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:27:56,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:27:56,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:27:56,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:27:56,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:27:56,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:27:56,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:27:56,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:27:56,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:27:56,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:27:56,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:27:56,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:27:56,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:27:56,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:27:56,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:27:56,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:27:56,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:27:56,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:27:56,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:27:56,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:27:56,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:27:56,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:27:56,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:27:56,576 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:27:56,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:27:56,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:27:56,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:27:56,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:27:56,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:27:56,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:27:56,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:27:56,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:27:56,609 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:27:56,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:27:56,609 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:27:56,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:27:56,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:27:56,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:27:56,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:27:56,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:27:56,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:27:56,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:27:56,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:27:56,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:27:56,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:27:56,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:27:56,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:27:56,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:27:56,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:27:56,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:27:56,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:27:56,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:27:56,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:27:56,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:27:56,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:27:56,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:27:56,617 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:27:56,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:27:56,618 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_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 [2022-11-25 18:27:57,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:27:57,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:27:57,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:27:57,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:27:57,054 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:27:57,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix001.opt.i [2022-11-25 18:28:00,472 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:28:00,878 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:28:00,879 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/sv-benchmarks/c/pthread-wmm/mix001.opt.i [2022-11-25 18:28:00,911 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/data/5369cd540/7dc1917aecb14280a98b14db333494f1/FLAG14f9dd2ca [2022-11-25 18:28:00,935 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/data/5369cd540/7dc1917aecb14280a98b14db333494f1 [2022-11-25 18:28:00,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:28:00,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:28:00,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:28:00,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:28:00,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:28:00,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:28:00" (1/1) ... [2022-11-25 18:28:00,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733e9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:00, skipping insertion in model container [2022-11-25 18:28:00,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:28:00" (1/1) ... [2022-11-25 18:28:00,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:28:01,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:28:01,219 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_419a24ba-9747-4562-9b95-b998c9b4adcf/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2022-11-25 18:28:01,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:28:01,556 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:28:01,580 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_419a24ba-9747-4562-9b95-b998c9b4adcf/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2022-11-25 18:28:01,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:28:01,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:28:01,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:28:01,756 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:28:01,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01 WrapperNode [2022-11-25 18:28:01,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:28:01,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:28:01,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:28:01,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:28:01,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,817 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-25 18:28:01,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:28:01,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:28:01,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:28:01,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:28:01,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,869 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:28:01,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:28:01,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:28:01,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:28:01,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (1/1) ... [2022-11-25 18:28:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:28:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:28:01,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:28:01,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:28:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:28:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:28:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:28:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:28:01,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:28:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:28:01,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:28:01,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:28:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:28:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:28:01,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:28:02,001 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:28:02,245 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:28:02,263 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:28:02,658 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:28:02,887 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:28:02,887 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:28:02,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:28:02 BoogieIcfgContainer [2022-11-25 18:28:02,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:28:02,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:28:02,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:28:02,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:28:02,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:28:00" (1/3) ... [2022-11-25 18:28:02,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a041e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:28:02, skipping insertion in model container [2022-11-25 18:28:02,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:28:01" (2/3) ... [2022-11-25 18:28:02,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a041e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:28:02, skipping insertion in model container [2022-11-25 18:28:02,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:28:02" (3/3) ... [2022-11-25 18:28:02,908 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2022-11-25 18:28:02,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:28:02,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:28:02,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:28:02,933 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:28:03,036 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:28:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-11-25 18:28:03,190 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-11-25 18:28:03,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:28:03,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 18:28:03,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-11-25 18:28:03,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-11-25 18:28:03,216 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:28:03,250 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2022-11-25 18:28:03,254 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2022-11-25 18:28:03,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2022-11-25 18:28:03,345 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-11-25 18:28:03,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:28:03,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 18:28:03,348 INFO L119 LiptonReduction]: Number of co-enabled transitions 2162 [2022-11-25 18:28:09,486 INFO L134 LiptonReduction]: Checked pairs total: 6043 [2022-11-25 18:28:09,488 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-11-25 18:28:09,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:28:09,525 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;@653c8b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:28:09,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:28:09,542 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-11-25 18:28:09,542 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:28:09,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:09,545 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:09,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:09,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1013945164, now seen corresponding path program 1 times [2022-11-25 18:28:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:09,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724582141] [2022-11-25 18:28:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:10,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724582141] [2022-11-25 18:28:10,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724582141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:10,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:10,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:28:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789695269] [2022-11-25 18:28:10,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:10,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:28:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:28:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:28:10,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 228 [2022-11-25 18:28:10,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:10,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:10,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 228 [2022-11-25 18:28:10,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:10,606 INFO L130 PetriNetUnfolder]: 644/1040 cut-off events. [2022-11-25 18:28:10,606 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-25 18:28:10,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 1040 events. 644/1040 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5314 event pairs, 112 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2041. Up to 773 conditions per place. [2022-11-25 18:28:10,618 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 24 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2022-11-25 18:28:10,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 129 flow [2022-11-25 18:28:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:28:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:28:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-11-25 18:28:10,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5146198830409356 [2022-11-25 18:28:10,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2022-11-25 18:28:10,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2022-11-25 18:28:10,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:10,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2022-11-25 18:28:10,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:10,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:10,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:10,670 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 352 transitions. [2022-11-25 18:28:10,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 129 flow [2022-11-25 18:28:10,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:28:10,679 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-25 18:28:10,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 18:28:10,686 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 18:28:10,687 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-25 18:28:10,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:10,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:10,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:10,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:28:10,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -556190857, now seen corresponding path program 1 times [2022-11-25 18:28:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736814607] [2022-11-25 18:28:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:11,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736814607] [2022-11-25 18:28:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736814607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:11,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:11,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:28:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603525656] [2022-11-25 18:28:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:11,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:28:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:28:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:28:11,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 228 [2022-11-25 18:28:11,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:11,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:11,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 228 [2022-11-25 18:28:11,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:11,299 INFO L130 PetriNetUnfolder]: 453/741 cut-off events. [2022-11-25 18:28:11,299 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-25 18:28:11,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 741 events. 453/741 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3447 event pairs, 177 based on Foata normal form. 24/760 useless extension candidates. Maximal degree in co-relation 1503. Up to 445 conditions per place. [2022-11-25 18:28:11,307 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-11-25 18:28:11,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 118 flow [2022-11-25 18:28:11,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:28:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:28:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-25 18:28:11,316 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5073099415204678 [2022-11-25 18:28:11,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-25 18:28:11,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-25 18:28:11,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:11,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-25 18:28:11,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:11,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:11,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:11,326 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 347 transitions. [2022-11-25 18:28:11,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 118 flow [2022-11-25 18:28:11,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:28:11,330 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-11-25 18:28:11,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 18:28:11,332 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 18:28:11,332 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-11-25 18:28:11,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:11,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:11,334 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:11,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:28:11,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1987512029, now seen corresponding path program 1 times [2022-11-25 18:28:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:11,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756112458] [2022-11-25 18:28:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:11,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756112458] [2022-11-25 18:28:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756112458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:11,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:11,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:28:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697149995] [2022-11-25 18:28:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:11,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:28:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:28:11,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:28:12,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 228 [2022-11-25 18:28:12,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:12,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:12,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 228 [2022-11-25 18:28:12,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:12,347 INFO L130 PetriNetUnfolder]: 599/982 cut-off events. [2022-11-25 18:28:12,347 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-11-25 18:28:12,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 982 events. 599/982 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4721 event pairs, 221 based on Foata normal form. 24/996 useless extension candidates. Maximal degree in co-relation 2078. Up to 515 conditions per place. [2022-11-25 18:28:12,354 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 34 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-11-25 18:28:12,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 190 flow [2022-11-25 18:28:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:28:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:28:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-11-25 18:28:12,356 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5054824561403509 [2022-11-25 18:28:12,357 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 461 transitions. [2022-11-25 18:28:12,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 461 transitions. [2022-11-25 18:28:12,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:12,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 461 transitions. [2022-11-25 18:28:12,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:12,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:12,361 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:12,362 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 461 transitions. [2022-11-25 18:28:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 190 flow [2022-11-25 18:28:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:28:12,365 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 92 flow [2022-11-25 18:28:12,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-11-25 18:28:12,366 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-11-25 18:28:12,367 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 92 flow [2022-11-25 18:28:12,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:12,367 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:12,368 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:28:12,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 153662175, now seen corresponding path program 1 times [2022-11-25 18:28:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248746459] [2022-11-25 18:28:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:13,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248746459] [2022-11-25 18:28:13,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248746459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:13,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:13,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:28:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621137167] [2022-11-25 18:28:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:13,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:28:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:28:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:28:13,063 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 228 [2022-11-25 18:28:13,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:13,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:13,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 228 [2022-11-25 18:28:13,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:13,427 INFO L130 PetriNetUnfolder]: 1153/1722 cut-off events. [2022-11-25 18:28:13,427 INFO L131 PetriNetUnfolder]: For 425/425 co-relation queries the response was YES. [2022-11-25 18:28:13,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4256 conditions, 1722 events. 1153/1722 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6822 event pairs, 259 based on Foata normal form. 24/1746 useless extension candidates. Maximal degree in co-relation 4243. Up to 1130 conditions per place. [2022-11-25 18:28:13,440 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 51 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2022-11-25 18:28:13,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 316 flow [2022-11-25 18:28:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:28:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:28:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2022-11-25 18:28:13,443 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4587719298245614 [2022-11-25 18:28:13,443 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2022-11-25 18:28:13,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2022-11-25 18:28:13,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:13,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2022-11-25 18:28:13,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:13,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:13,449 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:13,449 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 92 flow. Second operand 5 states and 523 transitions. [2022-11-25 18:28:13,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 316 flow [2022-11-25 18:28:13,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:28:13,453 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 161 flow [2022-11-25 18:28:13,453 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-11-25 18:28:13,454 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-11-25 18:28:13,454 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 161 flow [2022-11-25 18:28:13,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:13,455 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:13,455 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:13,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:28:13,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash 604973490, now seen corresponding path program 1 times [2022-11-25 18:28:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:13,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746200804] [2022-11-25 18:28:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:13,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746200804] [2022-11-25 18:28:13,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746200804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:13,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:13,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:28:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012603772] [2022-11-25 18:28:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:13,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:28:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:28:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:28:13,760 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-11-25 18:28:13,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:13,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:13,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-11-25 18:28:13,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:14,091 INFO L130 PetriNetUnfolder]: 474/824 cut-off events. [2022-11-25 18:28:14,092 INFO L131 PetriNetUnfolder]: For 708/708 co-relation queries the response was YES. [2022-11-25 18:28:14,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 824 events. 474/824 cut-off events. For 708/708 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4074 event pairs, 82 based on Foata normal form. 96/916 useless extension candidates. Maximal degree in co-relation 2238. Up to 439 conditions per place. [2022-11-25 18:28:14,099 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 59 selfloop transitions, 8 changer transitions 6/80 dead transitions. [2022-11-25 18:28:14,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 80 transitions, 537 flow [2022-11-25 18:28:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:28:14,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:28:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-11-25 18:28:14,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49736842105263157 [2022-11-25 18:28:14,102 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2022-11-25 18:28:14,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2022-11-25 18:28:14,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:14,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2022-11-25 18:28:14,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,109 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,109 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 161 flow. Second operand 5 states and 567 transitions. [2022-11-25 18:28:14,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 80 transitions, 537 flow [2022-11-25 18:28:14,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 80 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:28:14,114 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 219 flow [2022-11-25 18:28:14,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-11-25 18:28:14,115 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-11-25 18:28:14,115 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 219 flow [2022-11-25 18:28:14,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:14,116 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:14,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:28:14,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1672633993, now seen corresponding path program 1 times [2022-11-25 18:28:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981811715] [2022-11-25 18:28:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:14,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981811715] [2022-11-25 18:28:14,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981811715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:14,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:14,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:28:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324351619] [2022-11-25 18:28:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:14,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:28:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:28:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:28:14,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-11-25 18:28:14,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:14,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-11-25 18:28:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:14,770 INFO L130 PetriNetUnfolder]: 376/690 cut-off events. [2022-11-25 18:28:14,770 INFO L131 PetriNetUnfolder]: For 1049/1069 co-relation queries the response was YES. [2022-11-25 18:28:14,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 690 events. 376/690 cut-off events. For 1049/1069 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3443 event pairs, 46 based on Foata normal form. 66/752 useless extension candidates. Maximal degree in co-relation 2335. Up to 205 conditions per place. [2022-11-25 18:28:14,777 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 65 selfloop transitions, 14 changer transitions 14/100 dead transitions. [2022-11-25 18:28:14,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 709 flow [2022-11-25 18:28:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:28:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:28:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 794 transitions. [2022-11-25 18:28:14,782 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4974937343358396 [2022-11-25 18:28:14,782 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 794 transitions. [2022-11-25 18:28:14,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 794 transitions. [2022-11-25 18:28:14,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:14,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 794 transitions. [2022-11-25 18:28:14,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,790 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,790 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 219 flow. Second operand 7 states and 794 transitions. [2022-11-25 18:28:14,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 709 flow [2022-11-25 18:28:14,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 709 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:28:14,798 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 298 flow [2022-11-25 18:28:14,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-11-25 18:28:14,802 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-11-25 18:28:14,802 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 298 flow [2022-11-25 18:28:14,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:14,803 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:14,803 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:14,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:28:14,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1323801893, now seen corresponding path program 1 times [2022-11-25 18:28:14,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:14,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546983835] [2022-11-25 18:28:14,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:14,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546983835] [2022-11-25 18:28:15,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546983835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:15,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:15,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:28:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030953361] [2022-11-25 18:28:15,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:15,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:28:15,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:15,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:28:15,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:28:15,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 228 [2022-11-25 18:28:15,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:15,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:15,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 228 [2022-11-25 18:28:15,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:15,555 INFO L130 PetriNetUnfolder]: 629/1167 cut-off events. [2022-11-25 18:28:15,556 INFO L131 PetriNetUnfolder]: For 2969/2969 co-relation queries the response was YES. [2022-11-25 18:28:15,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 1167 events. 629/1167 cut-off events. For 2969/2969 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6370 event pairs, 137 based on Foata normal form. 6/1172 useless extension candidates. Maximal degree in co-relation 4421. Up to 612 conditions per place. [2022-11-25 18:28:15,566 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 65 selfloop transitions, 2 changer transitions 19/92 dead transitions. [2022-11-25 18:28:15,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 822 flow [2022-11-25 18:28:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:28:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:28:15,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2022-11-25 18:28:15,569 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5021929824561403 [2022-11-25 18:28:15,569 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2022-11-25 18:28:15,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2022-11-25 18:28:15,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:15,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2022-11-25 18:28:15,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:15,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:15,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:15,574 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 298 flow. Second operand 4 states and 458 transitions. [2022-11-25 18:28:15,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 822 flow [2022-11-25 18:28:15,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 741 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-11-25 18:28:15,597 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 258 flow [2022-11-25 18:28:15,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2022-11-25 18:28:15,598 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-11-25 18:28:15,599 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 258 flow [2022-11-25 18:28:15,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:15,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:15,600 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:15,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:28:15,601 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1216755793, now seen corresponding path program 2 times [2022-11-25 18:28:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:15,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833817395] [2022-11-25 18:28:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:16,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:16,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833817395] [2022-11-25 18:28:16,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833817395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:16,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:16,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:28:16,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132308874] [2022-11-25 18:28:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:16,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:28:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:28:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:28:16,028 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-11-25 18:28:16,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:16,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-11-25 18:28:16,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:16,370 INFO L130 PetriNetUnfolder]: 384/734 cut-off events. [2022-11-25 18:28:16,371 INFO L131 PetriNetUnfolder]: For 1420/1429 co-relation queries the response was YES. [2022-11-25 18:28:16,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 734 events. 384/734 cut-off events. For 1420/1429 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3916 event pairs, 52 based on Foata normal form. 28/744 useless extension candidates. Maximal degree in co-relation 2680. Up to 158 conditions per place. [2022-11-25 18:28:16,377 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 50 selfloop transitions, 15 changer transitions 26/98 dead transitions. [2022-11-25 18:28:16,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 98 transitions, 745 flow [2022-11-25 18:28:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:28:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 18:28:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 997 transitions. [2022-11-25 18:28:16,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48586744639376217 [2022-11-25 18:28:16,381 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 997 transitions. [2022-11-25 18:28:16,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 997 transitions. [2022-11-25 18:28:16,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:16,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 997 transitions. [2022-11-25 18:28:16,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,390 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,390 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 258 flow. Second operand 9 states and 997 transitions. [2022-11-25 18:28:16,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 98 transitions, 745 flow [2022-11-25 18:28:16,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 707 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-25 18:28:16,399 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 265 flow [2022-11-25 18:28:16,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=265, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2022-11-25 18:28:16,400 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-11-25 18:28:16,400 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 265 flow [2022-11-25 18:28:16,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,401 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:16,401 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:16,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:28:16,402 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2106070104, now seen corresponding path program 1 times [2022-11-25 18:28:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:16,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543624287] [2022-11-25 18:28:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:16,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543624287] [2022-11-25 18:28:16,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543624287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:16,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:16,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:28:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853100972] [2022-11-25 18:28:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:16,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:28:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:16,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:28:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:28:16,669 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 228 [2022-11-25 18:28:16,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:16,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 228 [2022-11-25 18:28:16,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:16,901 INFO L130 PetriNetUnfolder]: 396/812 cut-off events. [2022-11-25 18:28:16,901 INFO L131 PetriNetUnfolder]: For 1823/1828 co-relation queries the response was YES. [2022-11-25 18:28:16,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 812 events. 396/812 cut-off events. For 1823/1828 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4537 event pairs, 102 based on Foata normal form. 3/799 useless extension candidates. Maximal degree in co-relation 3032. Up to 423 conditions per place. [2022-11-25 18:28:16,906 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 26 selfloop transitions, 1 changer transitions 47/77 dead transitions. [2022-11-25 18:28:16,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 77 transitions, 679 flow [2022-11-25 18:28:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:28:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:28:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2022-11-25 18:28:16,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5010964912280702 [2022-11-25 18:28:16,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2022-11-25 18:28:16,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2022-11-25 18:28:16,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:16,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2022-11-25 18:28:16,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,913 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,913 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 265 flow. Second operand 4 states and 457 transitions. [2022-11-25 18:28:16,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 77 transitions, 679 flow [2022-11-25 18:28:16,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 552 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-11-25 18:28:16,923 INFO L231 Difference]: Finished difference. Result has 59 places, 28 transitions, 143 flow [2022-11-25 18:28:16,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=59, PETRI_TRANSITIONS=28} [2022-11-25 18:28:16,924 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-11-25 18:28:16,924 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 28 transitions, 143 flow [2022-11-25 18:28:16,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:16,925 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:16,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:16,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:28:16,925 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 711922536, now seen corresponding path program 2 times [2022-11-25 18:28:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:16,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351064265] [2022-11-25 18:28:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:28:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:28:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:28:18,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351064265] [2022-11-25 18:28:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351064265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:28:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:28:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:28:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954980156] [2022-11-25 18:28:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:28:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:28:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:28:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:28:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:28:18,818 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-11-25 18:28:18,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 28 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:18,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:28:18,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-11-25 18:28:18,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:28:19,025 INFO L130 PetriNetUnfolder]: 89/212 cut-off events. [2022-11-25 18:28:19,025 INFO L131 PetriNetUnfolder]: For 291/293 co-relation queries the response was YES. [2022-11-25 18:28:19,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 212 events. 89/212 cut-off events. For 291/293 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 771 event pairs, 28 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 705. Up to 58 conditions per place. [2022-11-25 18:28:19,027 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 21 selfloop transitions, 4 changer transitions 26/55 dead transitions. [2022-11-25 18:28:19,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 390 flow [2022-11-25 18:28:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:28:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:28:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 862 transitions. [2022-11-25 18:28:19,030 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4725877192982456 [2022-11-25 18:28:19,031 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 862 transitions. [2022-11-25 18:28:19,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 862 transitions. [2022-11-25 18:28:19,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:28:19,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 862 transitions. [2022-11-25 18:28:19,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:19,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 228.0) internal successors, (2052), 9 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:19,040 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 228.0) internal successors, (2052), 9 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:19,040 INFO L175 Difference]: Start difference. First operand has 59 places, 28 transitions, 143 flow. Second operand 8 states and 862 transitions. [2022-11-25 18:28:19,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 390 flow [2022-11-25 18:28:19,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 346 flow, removed 11 selfloop flow, removed 12 redundant places. [2022-11-25 18:28:19,043 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 130 flow [2022-11-25 18:28:19,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=8, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2022-11-25 18:28:19,045 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 18:28:19,045 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 130 flow [2022-11-25 18:28:19,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:28:19,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:28:19,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:28:19,047 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:28:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:28:19,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1386053384, now seen corresponding path program 3 times [2022-11-25 18:28:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:28:19,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379411465] [2022-11-25 18:28:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:28:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:28:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:28:19,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:28:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:28:19,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:28:19,252 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:28:19,253 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 18:28:19,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 18:28:19,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 18:28:19,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 18:28:19,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 18:28:19,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 18:28:19,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:28:19,257 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 18:28:19,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:28:19,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:28:19,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:28:19 BasicIcfg [2022-11-25 18:28:19,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:28:19,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:28:19,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:28:19,362 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:28:19,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:28:02" (3/4) ... [2022-11-25 18:28:19,365 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:28:19,505 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:28:19,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:28:19,506 INFO L158 Benchmark]: Toolchain (without parser) took 18560.65ms. Allocated memory was 172.0MB in the beginning and 375.4MB in the end (delta: 203.4MB). Free memory was 125.9MB in the beginning and 167.4MB in the end (delta: -41.5MB). Peak memory consumption was 162.8MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,506 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 91.2MB in the end (delta: 127.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.35ms. Allocated memory is still 172.0MB. Free memory was 125.5MB in the beginning and 139.4MB in the end (delta: -14.0MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.82ms. Allocated memory is still 172.0MB. Free memory was 139.4MB in the beginning and 136.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,510 INFO L158 Benchmark]: Boogie Preprocessor took 67.33ms. Allocated memory is still 172.0MB. Free memory was 136.3MB in the beginning and 134.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:28:19,510 INFO L158 Benchmark]: RCFGBuilder took 1003.73ms. Allocated memory is still 172.0MB. Free memory was 134.9MB in the beginning and 98.5MB in the end (delta: 36.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,510 INFO L158 Benchmark]: TraceAbstraction took 16467.86ms. Allocated memory was 172.0MB in the beginning and 375.4MB in the end (delta: 203.4MB). Free memory was 97.8MB in the beginning and 178.9MB in the end (delta: -81.2MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,511 INFO L158 Benchmark]: Witness Printer took 143.52ms. Allocated memory is still 375.4MB. Free memory was 178.9MB in the beginning and 167.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:28:19,512 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.33ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 91.2MB in the end (delta: 127.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.35ms. Allocated memory is still 172.0MB. Free memory was 125.5MB in the beginning and 139.4MB in the end (delta: -14.0MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.82ms. Allocated memory is still 172.0MB. Free memory was 139.4MB in the beginning and 136.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.33ms. Allocated memory is still 172.0MB. Free memory was 136.3MB in the beginning and 134.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1003.73ms. Allocated memory is still 172.0MB. Free memory was 134.9MB in the beginning and 98.5MB in the end (delta: 36.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16467.86ms. Allocated memory was 172.0MB in the beginning and 375.4MB in the end (delta: 203.4MB). Free memory was 97.8MB in the beginning and 178.9MB in the end (delta: -81.2MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. * Witness Printer took 143.52ms. Allocated memory is still 375.4MB. Free memory was 178.9MB in the beginning and 167.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 125 PlacesBefore, 34 PlacesAfterwards, 117 TransitionsBefore, 25 TransitionsAfterwards, 2162 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 6043 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3284, independent: 3088, independent conditional: 0, independent unconditional: 3088, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1679, independent: 1610, independent conditional: 0, independent unconditional: 1610, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1679, independent: 1594, independent conditional: 0, independent unconditional: 1594, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 610, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 579, dependent conditional: 0, dependent unconditional: 579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3284, independent: 1478, independent conditional: 0, independent unconditional: 1478, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1679, unknown conditional: 0, unknown unconditional: 1679] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17; [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17, ((void *)0), P0, ((void *)0))=-1, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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, z=0] [L855] 0 pthread_t t18; [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18, ((void *)0), P1, ((void *)0))=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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, z=0] [L857] 0 pthread_t t19; [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19, ((void *)0), P2, ((void *)0))=1, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [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] 3 __unbuffered_p2_EAX = 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_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 896 IncrementalHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 28 mSDtfsCounter, 896 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 18:28:19,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_419a24ba-9747-4562-9b95-b998c9b4adcf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE