./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- 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 17:46:00,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:46:00,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:46:00,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:46:00,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:46:00,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:46:00,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:46:00,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:46:00,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:46:00,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:46:00,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:46:00,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:46:00,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:46:00,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:46:00,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:46:00,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:46:00,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:46:00,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:46:00,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:46:00,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:46:00,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:46:00,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:46:00,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:46:00,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:46:00,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:46:00,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:46:00,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:46:00,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:46:00,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:46:00,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:46:00,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:46:00,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:46:00,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:46:00,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:46:00,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:46:00,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:46:00,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:46:00,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:46:00,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:46:00,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:46:00,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:46:00,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:46:00,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:46:00,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:46:00,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:46:00,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:46:00,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:46:00,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:46:00,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:46:00,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:46:00,579 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:46:00,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:46:00,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:46:00,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:46:00,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:46:00,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:46:00,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:46:00,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:46:00,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:46:00,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:46:00,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:46:00,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:46:00,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:46:00,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:46:00,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:46:00,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:46:00,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:46:00,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:46:00,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:46:00,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:46:00,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:46:00,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:46:00,587 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:46:00,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:46:00,587 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:46:00,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:46:00,588 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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2022-11-25 17:46:00,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:46:00,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:46:00,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:46:00,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:46:00,927 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:46:00,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:46:04,468 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:46:04,736 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:46:04,737 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:46:04,753 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/data/8b1a50c44/9274ddcbbd3a4658b99b6484bfcb4238/FLAG54d9dde10 [2022-11-25 17:46:04,769 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/data/8b1a50c44/9274ddcbbd3a4658b99b6484bfcb4238 [2022-11-25 17:46:04,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:46:04,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:46:04,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:46:04,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:46:04,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:46:04,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:46:04" (1/1) ... [2022-11-25 17:46:04,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e798f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:04, skipping insertion in model container [2022-11-25 17:46:04,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:46:04" (1/1) ... [2022-11-25 17:46:04,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:46:04,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:46:05,107 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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:46:05,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:46:05,570 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:46:05,592 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_de6eaad4-0afb-4a46-85c8-d061f84f3f98/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:46:05,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:46:05,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:46:05,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:46:05,782 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:46:05,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05 WrapperNode [2022-11-25 17:46:05,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:46:05,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:46:05,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:46:05,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:46:05,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,881 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 17:46:05,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:46:05,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:46:05,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:46:05,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:46:05,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,937 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:46:05,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:46:05,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:46:05,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:46:05,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (1/1) ... [2022-11-25 17:46:05,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:46:05,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:46:06,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:46:06,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:46:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:46:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:46:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:46:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:46:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:46:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:46:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:46:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:46:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:46:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:46:06,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:46:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:46:06,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:46:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:46:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:46:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:46:06,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:46:06,075 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 17:46:06,306 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:46:06,321 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:46:06,820 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:46:07,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:46:07,059 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:46:07,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:46:07 BoogieIcfgContainer [2022-11-25 17:46:07,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:46:07,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:46:07,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:46:07,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:46:07,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:46:04" (1/3) ... [2022-11-25 17:46:07,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6210b9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:46:07, skipping insertion in model container [2022-11-25 17:46:07,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:46:05" (2/3) ... [2022-11-25 17:46:07,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6210b9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:46:07, skipping insertion in model container [2022-11-25 17:46:07,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:46:07" (3/3) ... [2022-11-25 17:46:07,073 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:46:07,084 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:46:07,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:46:07,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:46:07,097 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:46:07,173 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:46:07,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-11-25 17:46:07,318 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-25 17:46:07,318 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:46:07,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 17:46:07,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-11-25 17:46:07,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-11-25 17:46:07,338 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:46:07,358 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2022-11-25 17:46:07,361 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2022-11-25 17:46:07,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2022-11-25 17:46:07,402 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-11-25 17:46:07,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:46:07,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-25 17:46:07,408 INFO L119 LiptonReduction]: Number of co-enabled transitions 3548 [2022-11-25 17:46:14,410 INFO L134 LiptonReduction]: Checked pairs total: 10564 [2022-11-25 17:46:14,411 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-25 17:46:14,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:46:14,456 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;@33f2807d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:46:14,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 17:46:14,461 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-25 17:46:14,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:46:14,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:14,463 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:46:14,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:14,473 INFO L85 PathProgramCache]: Analyzing trace with hash 575066, now seen corresponding path program 1 times [2022-11-25 17:46:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:14,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313659580] [2022-11-25 17:46:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:15,018 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 17:46:15,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:15,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313659580] [2022-11-25 17:46:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313659580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:15,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:46:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896544361] [2022-11-25 17:46:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:15,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:46:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:46:15,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:46:15,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 258 [2022-11-25 17:46:15,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 17:46:15,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:15,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 258 [2022-11-25 17:46:15,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:16,729 INFO L130 PetriNetUnfolder]: 4903/6758 cut-off events. [2022-11-25 17:46:16,729 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-11-25 17:46:16,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13606 conditions, 6758 events. 4903/6758 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33879 event pairs, 2535 based on Foata normal form. 0/6420 useless extension candidates. Maximal degree in co-relation 13594. Up to 5335 conditions per place. [2022-11-25 17:46:16,809 INFO L137 encePairwiseOnDemand]: 254/258 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-11-25 17:46:16,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2022-11-25 17:46:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:46:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:46:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-11-25 17:46:16,838 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5387596899224806 [2022-11-25 17:46:16,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2022-11-25 17:46:16,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2022-11-25 17:46:16,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:16,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2022-11-25 17:46:16,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 17:46:16,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:16,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:16,873 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 417 transitions. [2022-11-25 17:46:16,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2022-11-25 17:46:16,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:46:16,880 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2022-11-25 17:46:16,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-11-25 17:46:16,895 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-25 17:46:16,897 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2022-11-25 17:46:16,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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 17:46:16,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:16,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:16,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:46:16,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1448765511, now seen corresponding path program 1 times [2022-11-25 17:46:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737581165] [2022-11-25 17:46:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:17,415 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 17:46:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737581165] [2022-11-25 17:46:17,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737581165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:17,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:17,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:46:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468069656] [2022-11-25 17:46:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:17,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:46:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:46:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:46:17,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 17:46:17,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 17:46:17,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:17,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 17:46:17,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:21,814 INFO L130 PetriNetUnfolder]: 20021/27147 cut-off events. [2022-11-25 17:46:21,815 INFO L131 PetriNetUnfolder]: For 1238/1238 co-relation queries the response was YES. [2022-11-25 17:46:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56149 conditions, 27147 events. 20021/27147 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 145670 event pairs, 6977 based on Foata normal form. 760/27907 useless extension candidates. Maximal degree in co-relation 56139. Up to 16658 conditions per place. [2022-11-25 17:46:22,025 INFO L137 encePairwiseOnDemand]: 248/258 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2022-11-25 17:46:22,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-11-25 17:46:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:46:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:46:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-25 17:46:22,029 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 17:46:22,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-25 17:46:22,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-25 17:46:22,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:22,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-25 17:46:22,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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 17:46:22,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:22,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:22,039 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 387 transitions. [2022-11-25 17:46:22,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-11-25 17:46:22,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:46:22,043 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow [2022-11-25 17:46:22,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-11-25 17:46:22,051 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2022-11-25 17:46:22,051 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow [2022-11-25 17:46:22,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 17:46:22,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:22,054 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:22,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:46:22,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1962059015, now seen corresponding path program 1 times [2022-11-25 17:46:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:22,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361895019] [2022-11-25 17:46:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:22,377 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 17:46:22,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:22,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361895019] [2022-11-25 17:46:22,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361895019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:22,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:22,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:46:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871421479] [2022-11-25 17:46:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:22,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:46:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:46:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:46:22,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 17:46:22,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:22,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:22,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 17:46:22,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:25,820 INFO L130 PetriNetUnfolder]: 18540/25160 cut-off events. [2022-11-25 17:46:25,821 INFO L131 PetriNetUnfolder]: For 10983/10983 co-relation queries the response was YES. [2022-11-25 17:46:25,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63998 conditions, 25160 events. 18540/25160 cut-off events. For 10983/10983 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 135525 event pairs, 3595 based on Foata normal form. 275/25435 useless extension candidates. Maximal degree in co-relation 63986. Up to 11661 conditions per place. [2022-11-25 17:46:26,029 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 68 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2022-11-25 17:46:26,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 408 flow [2022-11-25 17:46:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:46:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:46:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2022-11-25 17:46:26,032 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.499031007751938 [2022-11-25 17:46:26,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2022-11-25 17:46:26,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2022-11-25 17:46:26,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:26,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2022-11-25 17:46:26,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:26,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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 17:46:26,039 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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 17:46:26,040 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 515 transitions. [2022-11-25 17:46:26,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 408 flow [2022-11-25 17:46:26,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:46:26,181 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2022-11-25 17:46:26,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-11-25 17:46:26,183 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2022-11-25 17:46:26,184 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2022-11-25 17:46:26,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:26,185 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:26,185 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:26,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:46:26,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:26,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2043937114, now seen corresponding path program 1 times [2022-11-25 17:46:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:26,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161492874] [2022-11-25 17:46:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:26,595 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 17:46:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:26,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161492874] [2022-11-25 17:46:26,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161492874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:26,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:26,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:46:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962130836] [2022-11-25 17:46:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:26,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:46:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:46:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:46:26,643 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 17:46:26,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 4 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 17:46:26,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:26,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 17:46:26,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:29,359 INFO L130 PetriNetUnfolder]: 18282/24814 cut-off events. [2022-11-25 17:46:29,360 INFO L131 PetriNetUnfolder]: For 18172/18172 co-relation queries the response was YES. [2022-11-25 17:46:29,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67095 conditions, 24814 events. 18282/24814 cut-off events. For 18172/18172 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 129608 event pairs, 1390 based on Foata normal form. 40/24854 useless extension candidates. Maximal degree in co-relation 67080. Up to 14076 conditions per place. [2022-11-25 17:46:29,539 INFO L137 encePairwiseOnDemand]: 248/258 looper letters, 60 selfloop transitions, 20 changer transitions 0/80 dead transitions. [2022-11-25 17:46:29,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 484 flow [2022-11-25 17:46:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:46:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:46:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2022-11-25 17:46:29,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2022-11-25 17:46:29,543 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2022-11-25 17:46:29,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2022-11-25 17:46:29,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:29,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2022-11-25 17:46:29,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 17:46:29,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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 17:46:29,550 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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 17:46:29,551 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 4 states and 512 transitions. [2022-11-25 17:46:29,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 484 flow [2022-11-25 17:46:29,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:46:29,860 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 348 flow [2022-11-25 17:46:29,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-11-25 17:46:29,862 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2022-11-25 17:46:29,863 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 348 flow [2022-11-25 17:46:29,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 17:46:29,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:29,864 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:29,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:46:29,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2140721915, now seen corresponding path program 1 times [2022-11-25 17:46:29,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:29,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848748371] [2022-11-25 17:46:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:30,065 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 17:46:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848748371] [2022-11-25 17:46:30,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848748371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:30,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:30,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:46:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894489662] [2022-11-25 17:46:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:30,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:46:30,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:46:30,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:46:30,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 258 [2022-11-25 17:46:30,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 17:46:30,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:30,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 258 [2022-11-25 17:46:30,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:32,660 INFO L130 PetriNetUnfolder]: 13468/19048 cut-off events. [2022-11-25 17:46:32,661 INFO L131 PetriNetUnfolder]: For 28440/29390 co-relation queries the response was YES. [2022-11-25 17:46:32,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53836 conditions, 19048 events. 13468/19048 cut-off events. For 28440/29390 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 111232 event pairs, 4127 based on Foata normal form. 364/18612 useless extension candidates. Maximal degree in co-relation 53817. Up to 12369 conditions per place. [2022-11-25 17:46:32,822 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 44 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2022-11-25 17:46:32,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 476 flow [2022-11-25 17:46:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:46:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:46:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-11-25 17:46:32,825 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.520671834625323 [2022-11-25 17:46:32,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2022-11-25 17:46:32,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2022-11-25 17:46:32,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:32,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2022-11-25 17:46:32,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 17:46:32,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:32,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:32,831 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 348 flow. Second operand 3 states and 403 transitions. [2022-11-25 17:46:32,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 476 flow [2022-11-25 17:46:33,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:46:33,009 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 362 flow [2022-11-25 17:46:33,009 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-11-25 17:46:33,012 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2022-11-25 17:46:33,012 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 362 flow [2022-11-25 17:46:33,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 17:46:33,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:33,013 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:33,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:46:33,014 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:33,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1465975325, now seen corresponding path program 1 times [2022-11-25 17:46:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679967009] [2022-11-25 17:46:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:33,247 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 17:46:33,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:33,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679967009] [2022-11-25 17:46:33,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679967009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:33,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:33,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:46:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483556304] [2022-11-25 17:46:33,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:33,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:46:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:46:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:46:33,277 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 17:46:33,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:33,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:33,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 17:46:33,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:34,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][109], [Black: 157#true, 26#L773true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), 66#P2EXITtrue, 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 163#true, 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 81#L826true, Black: 171#true, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 181#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 123#L789true]) [2022-11-25 17:46:34,574 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:46:34,574 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:34,574 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:34,574 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:34,931 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][109], [Black: 157#true, 26#L773true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), 66#P2EXITtrue, 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 163#true, 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 171#true, Black: 173#(= ~z~0 0), P2Thread1of1ForFork0InUse, 25#L829true, P3Thread1of1ForFork2InUse, 179#true, P1Thread1of1ForFork3InUse, Black: 181#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 123#L789true]) [2022-11-25 17:46:34,931 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,931 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,931 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,931 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][123], [Black: 159#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 73#L2true, 77#L845true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 66#P2EXITtrue, 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 173#(= ~z~0 0), P2Thread1of1ForFork0InUse, 115#L766true, 171#true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, 179#true, P1Thread1of1ForFork3InUse, Black: 181#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 123#L789true, 163#true]) [2022-11-25 17:46:34,932 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:34,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:35,699 INFO L130 PetriNetUnfolder]: 10696/15860 cut-off events. [2022-11-25 17:46:35,700 INFO L131 PetriNetUnfolder]: For 20732/22378 co-relation queries the response was YES. [2022-11-25 17:46:35,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43477 conditions, 15860 events. 10696/15860 cut-off events. For 20732/22378 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 102654 event pairs, 1802 based on Foata normal form. 1349/16591 useless extension candidates. Maximal degree in co-relation 43455. Up to 9209 conditions per place. [2022-11-25 17:46:35,843 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 96 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2022-11-25 17:46:35,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 126 transitions, 960 flow [2022-11-25 17:46:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:46:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:46:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2022-11-25 17:46:35,847 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5131782945736434 [2022-11-25 17:46:35,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2022-11-25 17:46:35,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2022-11-25 17:46:35,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:35,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2022-11-25 17:46:35,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 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 17:46:35,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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 17:46:35,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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 17:46:35,855 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 362 flow. Second operand 5 states and 662 transitions. [2022-11-25 17:46:35,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 126 transitions, 960 flow [2022-11-25 17:46:35,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:46:35,922 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 429 flow [2022-11-25 17:46:35,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=429, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2022-11-25 17:46:35,926 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2022-11-25 17:46:35,926 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 429 flow [2022-11-25 17:46:35,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:35,927 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:35,927 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 17:46:35,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:46:35,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:35,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1674685151, now seen corresponding path program 1 times [2022-11-25 17:46:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:35,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341835497] [2022-11-25 17:46:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:46:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341835497] [2022-11-25 17:46:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341835497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:36,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:36,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:46:36,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489411296] [2022-11-25 17:46:36,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:36,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:46:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:36,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:46:36,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:46:36,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 17:46:36,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:36,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:36,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 17:46:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:37,708 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][112], [Black: 186#(= ~__unbuffered_cnt~0 0), Black: 157#true, 26#L773true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 163#true, 66#P2EXITtrue, 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 81#L826true, Black: 171#true, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 123#L789true, 202#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-11-25 17:46:37,709 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,712 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][112], [Black: 186#(= ~__unbuffered_cnt~0 0), Black: 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 157#true, 26#L773true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), 66#P2EXITtrue, 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 163#true, 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 81#L826true, Black: 171#true, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 123#L789true, 184#true, 202#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-11-25 17:46:37,712 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,712 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,713 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:37,713 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 17:46:38,036 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][112], [Black: 186#(= ~__unbuffered_cnt~0 0), Black: 157#true, 26#L773true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 163#true, 66#P2EXITtrue, 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 171#true, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), 25#L829true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 181#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 123#L789true, 202#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-11-25 17:46:38,036 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,036 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,036 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,036 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,037 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][131], [Black: 186#(= ~__unbuffered_cnt~0 0), Black: 159#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 73#L2true, 77#L845true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 66#P2EXITtrue, 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 115#L766true, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), 171#true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, Black: 181#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, 123#L789true, 163#true, 202#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-11-25 17:46:38,037 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,037 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,037 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,037 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,038 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([401] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_65 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_76 256) 0))))) (and (= v_~a$w_buff1_used~0_64 (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_65)) (= v_~a$r_buff0_thd1~0_22 (ite .cse1 0 v_~a$r_buff0_thd1~0_23)) (= v_~a$r_buff1_thd1~0_17 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_64 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_18)) (= v_~a~0_34 (ite .cse4 v_~a$w_buff0~0_22 (ite .cse0 v_~a$w_buff1~0_21 v_~a~0_35))) (= v_~a$w_buff0_used~0_75 (ite .cse4 0 v_~a$w_buff0_used~0_76))))) InVars {~a~0=v_~a~0_35, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_76, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_65} OutVars{~a~0=v_~a~0_34, ~a$w_buff1~0=v_~a$w_buff1~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_75, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_64} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][112], [Black: 186#(= ~__unbuffered_cnt~0 0), Black: 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 157#true, 26#L773true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), 66#P2EXITtrue, 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 163#true, 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 171#true, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), 25#L829true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 181#(= ~__unbuffered_p3_EAX~0 0), 123#L789true, 184#true, 202#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-11-25 17:46:38,038 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,038 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,038 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,038 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,039 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L829-->L845: Formula: (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse8 (or .cse1 .cse2 .cse12)) (.cse9 (and (not .cse12) .cse11))) (let ((.cse7 (ite .cse8 v_~a~0_85 (ite .cse9 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~weak$$choice2~0_28 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= v_~a$flush_delayed~0_21 0) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse4 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse4 .cse5) (and .cse4 .cse6) .cse3)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse8 v_~a$w_buff0_used~0_148 (ite .cse9 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse5) .cse2 .cse3) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse3) .cse11) 0 v_~a$r_buff0_thd4~0_60))))))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][131], [Black: 186#(= ~__unbuffered_cnt~0 0), Black: 187#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 159#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 77#L845true, 73#L2true, Black: 165#(= ~__unbuffered_p1_EAX~0 0), Black: 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 66#P2EXITtrue, P2Thread1of1ForFork0InUse, Black: 173#(= ~z~0 0), 115#L766true, 171#true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 181#(= ~__unbuffered_p3_EAX~0 0), 123#L789true, 184#true, 163#true, 202#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 189#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2022-11-25 17:46:38,039 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,039 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,039 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,039 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:46:38,476 INFO L130 PetriNetUnfolder]: 8750/13304 cut-off events. [2022-11-25 17:46:38,477 INFO L131 PetriNetUnfolder]: For 21526/22745 co-relation queries the response was YES. [2022-11-25 17:46:38,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44461 conditions, 13304 events. 8750/13304 cut-off events. For 21526/22745 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 87789 event pairs, 1024 based on Foata normal form. 913/13693 useless extension candidates. Maximal degree in co-relation 44436. Up to 3793 conditions per place. [2022-11-25 17:46:38,578 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 132 selfloop transitions, 19 changer transitions 0/171 dead transitions. [2022-11-25 17:46:38,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 171 transitions, 1375 flow [2022-11-25 17:46:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:46:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:46:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 929 transitions. [2022-11-25 17:46:38,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5143964562569213 [2022-11-25 17:46:38,583 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 929 transitions. [2022-11-25 17:46:38,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 929 transitions. [2022-11-25 17:46:38,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:38,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 929 transitions. [2022-11-25 17:46:38,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 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 17:46:38,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:46:38,591 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:46:38,592 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 429 flow. Second operand 7 states and 929 transitions. [2022-11-25 17:46:38,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 171 transitions, 1375 flow [2022-11-25 17:46:38,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 171 transitions, 1370 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:46:38,708 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 558 flow [2022-11-25 17:46:38,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=558, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2022-11-25 17:46:38,709 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2022-11-25 17:46:38,709 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 558 flow [2022-11-25 17:46:38,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:38,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:38,710 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:46:38,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1110820926, now seen corresponding path program 1 times [2022-11-25 17:46:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:38,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3094830] [2022-11-25 17:46:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:38,963 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 17:46:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:38,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3094830] [2022-11-25 17:46:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3094830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:38,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:46:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926090] [2022-11-25 17:46:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:38,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:46:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:46:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:46:38,994 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 258 [2022-11-25 17:46:38,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 17:46:38,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:38,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 258 [2022-11-25 17:46:38,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:42,675 INFO L130 PetriNetUnfolder]: 18086/26092 cut-off events. [2022-11-25 17:46:42,675 INFO L131 PetriNetUnfolder]: For 92439/92439 co-relation queries the response was YES. [2022-11-25 17:46:42,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109570 conditions, 26092 events. 18086/26092 cut-off events. For 92439/92439 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 160079 event pairs, 3473 based on Foata normal form. 66/26158 useless extension candidates. Maximal degree in co-relation 109541. Up to 11960 conditions per place. [2022-11-25 17:46:42,809 INFO L137 encePairwiseOnDemand]: 248/258 looper letters, 94 selfloop transitions, 22 changer transitions 46/162 dead transitions. [2022-11-25 17:46:42,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 162 transitions, 1553 flow [2022-11-25 17:46:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:46:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:46:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2022-11-25 17:46:42,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2022-11-25 17:46:42,820 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2022-11-25 17:46:42,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2022-11-25 17:46:42,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:42,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2022-11-25 17:46:42,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 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 17:46:42,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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 17:46:42,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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 17:46:42,829 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 558 flow. Second operand 4 states and 522 transitions. [2022-11-25 17:46:42,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 162 transitions, 1553 flow [2022-11-25 17:46:45,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 162 transitions, 1407 flow, removed 51 selfloop flow, removed 3 redundant places. [2022-11-25 17:46:45,338 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 590 flow [2022-11-25 17:46:45,338 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=590, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2022-11-25 17:46:45,341 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2022-11-25 17:46:45,341 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 590 flow [2022-11-25 17:46:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 17:46:45,342 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:45,342 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] [2022-11-25 17:46:45,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:46:45,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1102999624, now seen corresponding path program 1 times [2022-11-25 17:46:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:45,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632322936] [2022-11-25 17:46:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:45,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:45,637 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 17:46:45,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:45,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632322936] [2022-11-25 17:46:45,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632322936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:45,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:45,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:46:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481380203] [2022-11-25 17:46:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:45,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:46:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:46:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:46:45,661 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 17:46:45,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 590 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 17:46:45,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:45,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 17:46:45,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:46,988 INFO L130 PetriNetUnfolder]: 4694/7604 cut-off events. [2022-11-25 17:46:46,988 INFO L131 PetriNetUnfolder]: For 20183/20804 co-relation queries the response was YES. [2022-11-25 17:46:47,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27100 conditions, 7604 events. 4694/7604 cut-off events. For 20183/20804 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 50126 event pairs, 942 based on Foata normal form. 581/7968 useless extension candidates. Maximal degree in co-relation 27068. Up to 2557 conditions per place. [2022-11-25 17:46:47,025 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 123 selfloop transitions, 18 changer transitions 19/179 dead transitions. [2022-11-25 17:46:47,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 179 transitions, 1768 flow [2022-11-25 17:46:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:46:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:46:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 930 transitions. [2022-11-25 17:46:47,030 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5149501661129569 [2022-11-25 17:46:47,030 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 930 transitions. [2022-11-25 17:46:47,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 930 transitions. [2022-11-25 17:46:47,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:47,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 930 transitions. [2022-11-25 17:46:47,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 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 17:46:47,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:46:47,038 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:46:47,038 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 590 flow. Second operand 7 states and 930 transitions. [2022-11-25 17:46:47,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 179 transitions, 1768 flow [2022-11-25 17:46:47,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 179 transitions, 1661 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-11-25 17:46:47,106 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 686 flow [2022-11-25 17:46:47,106 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=686, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2022-11-25 17:46:47,107 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2022-11-25 17:46:47,107 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 686 flow [2022-11-25 17:46:47,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 17:46:47,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:47,108 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:47,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:46:47,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1918287357, now seen corresponding path program 1 times [2022-11-25 17:46:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:47,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526042227] [2022-11-25 17:46:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:47,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:47,294 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 17:46:47,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:47,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526042227] [2022-11-25 17:46:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526042227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:47,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:47,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:46:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521926910] [2022-11-25 17:46:47,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:47,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:46:47,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:47,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:46:47,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:46:47,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 258 [2022-11-25 17:46:47,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 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 17:46:47,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:47,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 258 [2022-11-25 17:46:47,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:48,815 INFO L130 PetriNetUnfolder]: 6668/10794 cut-off events. [2022-11-25 17:46:48,816 INFO L131 PetriNetUnfolder]: For 30567/31114 co-relation queries the response was YES. [2022-11-25 17:46:48,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42811 conditions, 10794 events. 6668/10794 cut-off events. For 30567/31114 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 73858 event pairs, 2225 based on Foata normal form. 222/10644 useless extension candidates. Maximal degree in co-relation 42778. Up to 5535 conditions per place. [2022-11-25 17:46:48,877 INFO L137 encePairwiseOnDemand]: 255/258 looper letters, 67 selfloop transitions, 8 changer transitions 26/111 dead transitions. [2022-11-25 17:46:48,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 1171 flow [2022-11-25 17:46:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:46:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:46:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-11-25 17:46:48,879 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2022-11-25 17:46:48,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-11-25 17:46:48,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-11-25 17:46:48,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:48,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-11-25 17:46:48,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:46:48,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:48,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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 17:46:48,884 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 686 flow. Second operand 3 states and 405 transitions. [2022-11-25 17:46:48,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 1171 flow [2022-11-25 17:46:49,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 1042 flow, removed 52 selfloop flow, removed 2 redundant places. [2022-11-25 17:46:49,308 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 534 flow [2022-11-25 17:46:49,308 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2022-11-25 17:46:49,309 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2022-11-25 17:46:49,309 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 534 flow [2022-11-25 17:46:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 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 17:46:49,309 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:49,310 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:49,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:46:49,310 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash 209160528, now seen corresponding path program 1 times [2022-11-25 17:46:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:49,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258226832] [2022-11-25 17:46:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:50,402 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 17:46:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:50,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258226832] [2022-11-25 17:46:50,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258226832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:50,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:46:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245773380] [2022-11-25 17:46:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:50,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:46:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:46:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:46:50,466 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 17:46:50,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 534 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 17:46:50,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:50,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 17:46:50,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:52,717 INFO L130 PetriNetUnfolder]: 8932/15284 cut-off events. [2022-11-25 17:46:52,717 INFO L131 PetriNetUnfolder]: For 29477/30146 co-relation queries the response was YES. [2022-11-25 17:46:52,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53225 conditions, 15284 events. 8932/15284 cut-off events. For 29477/30146 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 121469 event pairs, 1129 based on Foata normal form. 247/15224 useless extension candidates. Maximal degree in co-relation 53191. Up to 7250 conditions per place. [2022-11-25 17:46:52,791 INFO L137 encePairwiseOnDemand]: 249/258 looper letters, 142 selfloop transitions, 11 changer transitions 59/226 dead transitions. [2022-11-25 17:46:52,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 226 transitions, 2000 flow [2022-11-25 17:46:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:46:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:46:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 929 transitions. [2022-11-25 17:46:52,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5143964562569213 [2022-11-25 17:46:52,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 929 transitions. [2022-11-25 17:46:52,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 929 transitions. [2022-11-25 17:46:52,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:52,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 929 transitions. [2022-11-25 17:46:52,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 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 17:46:52,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:46:52,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:46:52,802 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 534 flow. Second operand 7 states and 929 transitions. [2022-11-25 17:46:52,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 226 transitions, 2000 flow [2022-11-25 17:46:53,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 226 transitions, 1922 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 17:46:53,282 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 601 flow [2022-11-25 17:46:53,283 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=601, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2022-11-25 17:46:53,283 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2022-11-25 17:46:53,284 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 601 flow [2022-11-25 17:46:53,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 17:46:53,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:53,284 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:53,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:46:53,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1009828231, now seen corresponding path program 2 times [2022-11-25 17:46:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:53,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386750994] [2022-11-25 17:46:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:53,533 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 17:46:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386750994] [2022-11-25 17:46:53,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386750994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:53,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:53,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:46:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764898488] [2022-11-25 17:46:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:53,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:46:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:46:53,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:46:53,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 258 [2022-11-25 17:46:53,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 601 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 17:46:53,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:53,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 258 [2022-11-25 17:46:53,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:56,372 INFO L130 PetriNetUnfolder]: 13338/21293 cut-off events. [2022-11-25 17:46:56,372 INFO L131 PetriNetUnfolder]: For 72730/72730 co-relation queries the response was YES. [2022-11-25 17:46:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90481 conditions, 21293 events. 13338/21293 cut-off events. For 72730/72730 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 152771 event pairs, 2299 based on Foata normal form. 14/21307 useless extension candidates. Maximal degree in co-relation 90444. Up to 12540 conditions per place. [2022-11-25 17:46:56,495 INFO L137 encePairwiseOnDemand]: 247/258 looper letters, 123 selfloop transitions, 35 changer transitions 28/186 dead transitions. [2022-11-25 17:46:56,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 186 transitions, 1738 flow [2022-11-25 17:46:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:46:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:46:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-11-25 17:46:56,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49224806201550386 [2022-11-25 17:46:56,499 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-11-25 17:46:56,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-11-25 17:46:56,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:56,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-11-25 17:46:56,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 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 17:46:56,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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 17:46:56,504 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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 17:46:56,505 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 601 flow. Second operand 5 states and 635 transitions. [2022-11-25 17:46:56,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 186 transitions, 1738 flow [2022-11-25 17:46:57,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 186 transitions, 1689 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-25 17:46:57,550 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 822 flow [2022-11-25 17:46:57,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=822, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2022-11-25 17:46:57,551 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2022-11-25 17:46:57,551 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 822 flow [2022-11-25 17:46:57,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 17:46:57,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:46:57,552 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:46:57,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:46:57,552 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:46:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:46:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1276209184, now seen corresponding path program 2 times [2022-11-25 17:46:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:46:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655480203] [2022-11-25 17:46:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:46:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:46:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:46:57,839 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 17:46:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:46:57,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655480203] [2022-11-25 17:46:57,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655480203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:46:57,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:46:57,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:46:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536178764] [2022-11-25 17:46:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:46:57,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:46:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:46:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:46:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:46:57,860 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 17:46:57,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 822 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 17:46:57,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:46:57,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 17:46:57,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:46:59,494 INFO L130 PetriNetUnfolder]: 6512/10955 cut-off events. [2022-11-25 17:46:59,494 INFO L131 PetriNetUnfolder]: For 34636/36033 co-relation queries the response was YES. [2022-11-25 17:46:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44941 conditions, 10955 events. 6512/10955 cut-off events. For 34636/36033 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 82044 event pairs, 830 based on Foata normal form. 561/11280 useless extension candidates. Maximal degree in co-relation 44904. Up to 4291 conditions per place. [2022-11-25 17:46:59,563 INFO L137 encePairwiseOnDemand]: 251/258 looper letters, 92 selfloop transitions, 18 changer transitions 68/192 dead transitions. [2022-11-25 17:46:59,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 192 transitions, 2029 flow [2022-11-25 17:46:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:46:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:46:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2022-11-25 17:46:59,568 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.501453488372093 [2022-11-25 17:46:59,568 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2022-11-25 17:46:59,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2022-11-25 17:46:59,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:46:59,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2022-11-25 17:46:59,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 17:46:59,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 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 17:46:59,577 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 258.0) internal successors, (2322), 9 states have internal predecessors, (2322), 0 states have call successors, (0), 0 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 17:46:59,577 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 822 flow. Second operand 8 states and 1035 transitions. [2022-11-25 17:46:59,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 192 transitions, 2029 flow [2022-11-25 17:47:00,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 192 transitions, 1989 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-11-25 17:47:00,486 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 600 flow [2022-11-25 17:47:00,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=600, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2022-11-25 17:47:00,487 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2022-11-25 17:47:00,487 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 600 flow [2022-11-25 17:47:00,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 17:47:00,488 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:47:00,488 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:00,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:47:00,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:47:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash -310930313, now seen corresponding path program 1 times [2022-11-25 17:47:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:00,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072414514] [2022-11-25 17:47:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:47:01,736 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 17:47:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:47:01,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072414514] [2022-11-25 17:47:01,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072414514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:47:01,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:47:01,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:47:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506693642] [2022-11-25 17:47:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:47:01,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:47:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:47:01,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:47:01,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:47:01,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258 [2022-11-25 17:47:01,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:47:01,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:47:01,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258 [2022-11-25 17:47:01,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:47:02,747 INFO L130 PetriNetUnfolder]: 1969/3288 cut-off events. [2022-11-25 17:47:02,748 INFO L131 PetriNetUnfolder]: For 12477/12970 co-relation queries the response was YES. [2022-11-25 17:47:02,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15167 conditions, 3288 events. 1969/3288 cut-off events. For 12477/12970 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18972 event pairs, 256 based on Foata normal form. 236/3460 useless extension candidates. Maximal degree in co-relation 15129. Up to 2064 conditions per place. [2022-11-25 17:47:02,766 INFO L137 encePairwiseOnDemand]: 252/258 looper letters, 85 selfloop transitions, 5 changer transitions 32/136 dead transitions. [2022-11-25 17:47:02,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 136 transitions, 1398 flow [2022-11-25 17:47:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:47:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:47:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2022-11-25 17:47:02,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49335548172757476 [2022-11-25 17:47:02,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2022-11-25 17:47:02,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2022-11-25 17:47:02,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:47:02,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2022-11-25 17:47:02,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 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 17:47:02,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:47:02,779 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 states have internal predecessors, (2064), 0 states have call successors, (0), 0 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 17:47:02,779 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 600 flow. Second operand 7 states and 891 transitions. [2022-11-25 17:47:02,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 136 transitions, 1398 flow [2022-11-25 17:47:02,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 1188 flow, removed 47 selfloop flow, removed 10 redundant places. [2022-11-25 17:47:02,845 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 518 flow [2022-11-25 17:47:02,845 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=518, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2022-11-25 17:47:02,846 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2022-11-25 17:47:02,846 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 518 flow [2022-11-25 17:47:02,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:47:02,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:47:02,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:47:02,848 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 17:47:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:47:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1974963895, now seen corresponding path program 2 times [2022-11-25 17:47:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:47:02,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496168112] [2022-11-25 17:47:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:47:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:47:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:47:02,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:47:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:47:03,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:47:03,124 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:47:03,125 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 17:47:03,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 17:47:03,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 17:47:03,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 17:47:03,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 17:47:03,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 17:47:03,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 17:47:03,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:47:03,132 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:47:03,140 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:47:03,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:47:03,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:47:03 BasicIcfg [2022-11-25 17:47:03,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:47:03,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:47:03,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:47:03,302 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:47:03,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:46:07" (3/4) ... [2022-11-25 17:47:03,305 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:47:03,445 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:47:03,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:47:03,447 INFO L158 Benchmark]: Toolchain (without parser) took 58673.55ms. Allocated memory was 188.7MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 140.2MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-25 17:47:03,447 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:47:03,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1009.70ms. Allocated memory is still 188.7MB. Free memory was 140.2MB in the beginning and 111.9MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:47:03,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.98ms. Allocated memory is still 188.7MB. Free memory was 111.9MB in the beginning and 109.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:47:03,448 INFO L158 Benchmark]: Boogie Preprocessor took 76.52ms. Allocated memory is still 188.7MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:47:03,449 INFO L158 Benchmark]: RCFGBuilder took 1103.24ms. Allocated memory is still 188.7MB. Free memory was 107.2MB in the beginning and 139.3MB in the end (delta: -32.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-11-25 17:47:03,449 INFO L158 Benchmark]: TraceAbstraction took 56235.76ms. Allocated memory was 188.7MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 138.4MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-25 17:47:03,450 INFO L158 Benchmark]: Witness Printer took 144.79ms. Allocated memory is still 8.7GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:47:03,452 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.26ms. Allocated memory is still 142.6MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1009.70ms. Allocated memory is still 188.7MB. Free memory was 140.2MB in the beginning and 111.9MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.98ms. Allocated memory is still 188.7MB. Free memory was 111.9MB in the beginning and 109.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.52ms. Allocated memory is still 188.7MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1103.24ms. Allocated memory is still 188.7MB. Free memory was 107.2MB in the beginning and 139.3MB in the end (delta: -32.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 56235.76ms. Allocated memory was 188.7MB in the beginning and 8.7GB in the end (delta: 8.5GB). Free memory was 138.4MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 144.79ms. Allocated memory is still 8.7GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 146 PlacesBefore, 44 PlacesAfterwards, 135 TransitionsBefore, 32 TransitionsAfterwards, 3548 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 10564 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4481, independent: 4221, independent conditional: 0, independent unconditional: 4221, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2514, independent: 2426, independent conditional: 0, independent unconditional: 2426, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2514, independent: 2388, independent conditional: 0, independent unconditional: 2388, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 126, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 870, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 786, dependent conditional: 0, dependent unconditional: 786, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4481, independent: 1795, independent conditional: 0, independent unconditional: 1795, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 2514, unknown conditional: 0, unknown unconditional: 2514] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 293, Positive conditional cache size: 0, Positive unconditional cache size: 293, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=0, t601={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=1, t601={6:0}, t602={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=2, t601={6:0}, t602={7:0}, t603={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=3, t601={6:0}, t602={7:0}, t603={8:0}, t604={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={6:0}, t602={7:0}, t603={8:0}, t604={5:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 42.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 725 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1952 IncrementalHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 82 mSDtfsCounter, 1952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=12, InterpolantAutomatonStates: 70, 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, 5.3s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 1607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 17:47:03,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de6eaad4-0afb-4a46-85c8-d061f84f3f98/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